PROGRAMMING EXAMPLES

CODING: #include<stdio.h> #include<conio.h> struct node {  int data;  struct node *next; }; struct queue {  struct node *front;  struct node *rear; }; struct queue *q; void create_queue(struct queue *); struct queue *insert(struct queue *); struct queue *delete_element(struct queue *); struct queue *display(struct queue *); int peek(struct queue *); void main() { int ch,num; clrscr(); create_queue(q); do  {   printf("\nS E L E C T  C H O I C E");   printf("\n1.INSERT");   printf("\n2.DELETE");   printf("\n3.PEEK");   printf("\n4.DISPLAY");   printf("\n5.EXIT");   printf("\nEnter the Number:");   scanf("%d",&ch);   switch(ch)    {    case 1:    q=insert(q);    break;    case 2:    q=delete_element(q);    break;    case 3:    num=peek(q);    printf("%d is stored at the top of Queue.",num);    break;    case 4:    q=display(q);    break

CODING: #include<stdio.h> #include<conio.h> #define max 50 int q[max],front=-1,rear=-1; void push(); void pop(); void peep(); void display(); void main() { int ch; clrscr(); do {  printf("\nS E L E C T  C H O I C E");  printf("\n1.Insert Element.");  printf("\n2.Delete Element.");  printf("\n3.Peek.");  printf("\n4.Display Element.");  printf("\n5.Exit");  printf("\nEnter the choice:");  scanf("%d",&ch); switch(ch) { case 1: push(); break; case 2: pop(); break; case 3: peep(); break; case 4: display(); break; case 5: return; default: printf("TRY AGAIN."); break; } }while(ch!=5); getch(); } void push() { int num; printf("Enter the Number:"); scanf("%d",&num); if(rear==max-1)  printf("Queue id overflow."); if(rear==-1 && front==-1)  front=rear=0; else  rear++;  q[rear]=num;  printf(&q

CODING: #include<stdio.h> #include<conio.h> int partition(int list[],int beg,int end); void quick_sort(int list[],int beg,int end); void main() { int arry[50],i,n; clrscr(); printf("How many enter the element:"); scanf("%d",&n); for(i=0;i<n;i++)  {   printf("Enter the number:");   scanf("%d",&arry[i]);  } quick_sort(arry,0,n-1); printf("YOUR SORTED LIST:\n");  for(i=0;i<n;i++) printf("%d\n",arry[i]); getch(); } void quick_sort(int list[],int beg,int end) { int loc; if(beg<end)  {  loc=partition(list,beg,end);  quick_sort(list,beg,loc-1);  quick_sort(list,loc+1,end);  } } int partition(int list[],int beg,int end) { int left,right,temp,loc,flag; loc=left=beg; right=end; flag=0; while(flag!=1) {  while((list[loc]<=list[right]) && (loc!=right))     right--;   if(loc==right)     flag=1;   else if(list[loc]>list[right])    {     temp=list[loc];

CODING: #include<stdio.h> #include<conio.h> #include<malloc.h> struct stack { int no; struct stack *next; }; struct stack *top=NULL; struct stack *push(struct stack *,int); struct stack *pop(struct stack *); struct stack *update(struct stack *); struct stack *display(struct stack *); int peep(struct stack *); void main() { int val,ch; clrscr(); do {  printf("\n\nS E L E C T  O P E R A T I O N");  printf("\n1.PUSH");  printf("\n2.POP");  printf("\n3.PEEP");  printf("\n4.UPDATE");  printf("\n5.DISPLAY");  printf("\n6.EXIT");  printf("\nEnter The option:");  scanf("%d",&ch);  switch(ch)  {  case 1:  printf("\nEnter the number to be pushed on to the stack:");  scanf("%d",&val);  top=push(top,val);  break;  case 2:  top=pop(top);  break;  case 3:  val=peep(top);  printf("\nThe value stored at the top of the st

#include<stdio.h> #include<conio.h> #define max 10 int  st[max],top=-1; void push(int st[],int val); int  pop(int st[]); int  peep(int st[]); int  update(int st[]); void display(int st[]); void main() { int  val,ch; clrscr(); do { printf("\nS E L E C T  O P E R A T I O N\n"); printf("\n1.PUSH"); printf("\n2.POP"); printf("\n3.PEEK"); printf("\n4.UPDATE"); printf("\n5.OPEN"); printf("\n6.EXITE"); printf("\nEnter The option:");  scanf("%d",&ch); switch(ch) { case 1:  printf("Enter the number to be pushed on to the stack:");  scanf("%d",&val);  push(st,val);  break; case 2:  val=pop(st);  printf("\nThe Value deleted from the stack is:%d",val);  break; case 3:  val=peep(st);  printf("\nThe Value stored at the top of the stack is:%d",val);  break; case 4:  val=update(st);  printf("\nThe value is u

CODING: #include<stdio.h> #include<conio.h> void merge(int a[],int,int,int); void merge_sort(int a[],int,int); void main() { int arry[50],i,n; clrscr(); printf("How many enter the number:"); scanf("%d",&n); for(i=0;i<n;i++) { printf("Enter the number:"); scanf("%d",&arry[i]); } merge_sort(arry,0,n-1); printf("\nSorted The List."); for(i=0;i<n;i++) printf("\n%d",arry[i]); getch(); } void merge_sort(int arry[],int beg,int end) { int i,mid; if(beg<end) {  mid=(beg+end)/2;  merge_sort(arry,beg,mid);  merge_sort(arry,mid+1,end);  merge(arry,beg,mid,end); } } void merge(int arry[],int beg,int mid,int end) { int i=beg,j=mid+1,ii=beg,temp[50],k; while((i<=mid) && (j<=end)) {  if(arry[i]<arry[j])  {   temp[ii]=arry[i];   i++;  }  else  {   temp[ii]=arry[j];   j++;  }  ii++; } if(i>mid) {  while(j<=end)  {   temp[ii]=arry[j];   j+

A RRAY 1. C Program to Sort the Array in an Ascending Order. 2. C Program to Sort the Array in an descending Order. S EARCHING 1. Linear Search in C program.   2. Binary Search in  C program.   S ORTING   1. Alphabetical Sort in C program.     2. Bubble Sort in C program.     3. Selection Sort using function in C program.       4. Insertion Sort using function in C program.     5. Merge Sort using function in C program.     6. Quick Sort using function in C program.     7. Cocktail Sort in C program.     8. Gnome Sort in C program.     9. Heap Sort in C program.   10. Shell Sort in C program.   L INK LIST 1. Singly Linked List to implement Insertions,Deletions,Traversal,Splitting,Merging,Counting Node & Sorting in C program.   2. Doubly Linked List to implement Insertions,Deletions,Traversal,Splitting,Merging,Counting Node & Sorting in C program.   S TACK 1. Stack Array to implement Push, Pop, Peep & Update operations.   2. Linked Stack to impl