PROGRAMMING EXAMPLES

DOWNLOAD FULL PROGRAME CODING: #include<stdio.h> #include<conio.h> #define max 50 char st[max]; int top=-1; void push(char st[],char); char pop(char st[]); void intopostex(char source[],char target[]); int getpriority(char); void main() { char infix[50],postfix[50]; clrscr(); printf("\nENTER INFIX EXPRESSION:\n"); fflush(stdin); gets(infix); strcpy(postfix,""); intopostex(infix,postfix); printf("\nTHE POSTFIX EXPRESSION:\n"); puts(postfix); getch(); } void intopostex(char sourse[],char target[]) { int i=0,j=0; char temp; strcpy(target,""); while(sourse[i]!='\0')  {   if(sourse[i]=='(')    {     push(st,sourse[i]);     i++;    }   else if(sourse[i]==')')    {     while((top!=-1) && (st[top]!='('))     {      target[j]=pop(st);      j++;     }     if(top==-1)     {      printf("\nINCORRECT EXPRESSION..");      exit(1);     }     temp=pop

DOWNLOAD FULL PROGRAME CODING: #include<stdio.h> #include<conio.h> #define max 50 float st[max]; int top=-1; void  push(float st[],float num); float pop(float st[]); float postex(char exp[]); void main() { float num; char exp[50]; clrscr(); printf("ENTER THE POSTFIX EXPRESSION:\n"); fflush(stdin); gets(exp); num=postex(exp); printf("\nANSWER OF THE POSTFIX EXPRESSION:%f",num); getch(); } float postex(char exp[]) { int i=0; float no1,no2,num; while(exp[i]!='\0') {  if(isdigit(exp[i]))    push(st,(float)(exp[i]-'0'));  else  {   no1=pop(st);   no2=pop(st);  switch(exp[i])   {    case '+':    num=no1+no2;    break;    case '-':    num=no1-no2;    break;    case '*':    num=no1*no2;    break;    case '/':    num=no1/no2;    break;    case '%':    num=(int)no1%(int)no2;    break;    }     push(st,num);   }    i++;  }   return (pop(st)); } void

DOWNLOAD FULL PROGRAME CODING: #CREATE A LIST struct node *creatlist(struct node *start) { struct node *new_node; int num; printf("\nENTER '-1' FOR SAVE THE LIST."); printf("\nEnter The Number:"); scanf("%d",&num); while(num!=-1) { new_node=(struct node*)malloc(sizeof(struct node*)); new_node->no=num; if(start==NULL) {   new_node->next=NULL;   start=new_node;   cu++; } else {   new_node->next=start;   start=new_node;   cu++; } printf("Enter The Number:"); scanf("%d",&num); } return start; } #TRAVERSAL struct node *display(struct node *start) { struct node *ptr; ptr=start; printf("\nLIST OPEN...\n"); while(ptr!=NULL) {   printf("\n %d",ptr->no);   ptr=ptr->next; } return start; } #INSERT AT FIRST struct node *inserrecord(struct node *start) { int no; struct node *new_record; printf("\nEnter The Number:"); scanf("%d"

DOWNLOAD FULL PROGRAME CODING: #CREATE A LIST struct node *create(struct node *start) { struct node *new_node; int num,n; printf("\nHOW MANY ENTER THE RECORD IN LIST :"); scanf("%d",&n); do { printf("Enter the number:"); scanf("%d",&num);  if(start==NULL)  {   start=(struct node *)malloc(sizeof(struct node *));   start->prev=NULL;   start->data=num;   start->next=NULL;   count++;   n--;  }  else  {   new_node=(struct node *)malloc(sizeof(struct node *));   new_node->prev=NULL;   new_node->data=num;   new_node->next=start;   start->prev=new_node;   start=new_node;   count++;   n--;  } }while(0<n); return start; } #INSERT AT FIRST struct node *insert_beg(struct node *start) { struct node *new_node; int num; printf("Enter The Number:"); scanf("%d",&num); new_node=(struct node *)malloc(sizeof(struct node *)); start->prev=new_node; new_node->

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];