include<stdio.h> #include<conio.

h> #define max 10 int stack[max]; int top=-1; void push(int); int pop(); void display(); void main() { int n1,n2,ch; clrscr(); while(1); { printf(" 1.push"); printf("\n 2.pop"); printf("\n 3.display"); printf("\n 4.exit"); printf("\n enter option"); scanf("%d",&ch); switch(ch) { case 1: printf("enter value for insert"); scanf("%d",&n1); push(n1); getch(); break; case 2: n2=pop(); if(n2==-1) printf("stack is empty"); else printf("removing data is %d",n2); getch(); break; case 3: display(); getch(); break; case 4: exit(0); getch(); break; default: printf("invalid option"); getch(); } } } void push(int element) { if(top==-1) printf("stack is overflow"); else top=top+1; stack[top]=element; printf("enter elep==-1) ment in stack is %d",stack[top]); } int pop() { if(top==-1) return(-1) else element=stack[top];

top=top-1; return element; } void display() { int i; if(top==-1) printf("stack is empty"); else printf("elements are:"); for(i=max-1;i>=0;i--) { printf("%d",stack[i]); } }

QUEUE:
#include<stdio.h> #include<conio.h> #define max 10 int queue[max]; int front=-1; int rear=-1; void insert(int); int delete(); void display(); void main() { int n1,n2,ch; clrscr(); while(1); { printf("1 insert"); printf("\n 2.delete"); printf("\n 3.display"); printf("\n 4.exit"); printf("\n enter option"); scanf("%d",&ch); switch(ch) { case 1: printf("enter insert value"); scanf("%d",&n1); insert(n1); getch(); break; case 2: n2=delete(); if(n2==-1) printf("queue is empty"); else { printf("removing data is:",n2); } getch(); break; case 3: display(); getch(); break; case 4: exit(0);

getch(); break; default: printf("invalid option"); getch(); } } } void insert(int element) { if(rear>max-1) { printf("queue is overflow"); } if(rear==-1) { front=rear=rear+1; queue[rear]=element; } } int delete() { int num; if(front==-1||front>rear) { return(-1); } else { num=queue[front]; printf("front is %d \n deleted element is %d",front,num); front=front+1; return(num); } } void display() { int i; if(front==-1||front>rear) printf("queue is empty"); else { for(i=front;i<=rear;i++) printf("%d",queue[i]); } }

QUICK SORT:
#define MAXSIZE 20 Vodi quicksort(int elements[],int left,intright); Int element[maxsize]; Void main() { Int I,maxsize; Pf(\n how many arrays u want 2 sort); Sf(%d,maxsize); Pf(enter the values one by one); For(i=0;i<maxsize;i++) { Pf(\n enter element %i:,i); Sf(%d,& element[i]); } Pf(\n array before sorting:\n); For(i=0;i<maxsize;i++)

Pf([%i],elements[i]); Pf(\n); Quick sort(*elements,o,maxsize-1); Pf(\n array after sorting:\n); For(i=0;i<maxsize;i++) Pf(%d,elements[i]); } Void quick sort(int elements[],int left,iint right) { Int pivot,l,r; L=left; R=right; Pivot=elements[left]; While(left<right) { While((elements[right]>=pivot)&&(left<right)) Right--; If(left!=right) { Elements[left]=elements[right]; Left++; } While((elements[left]<=pivot)&&(left<right)) Left++; If(left!=right) { Elements[right]=elements[left]; Right--; } } Elements[left]=pivot; Pivot=left; Left=l; Right=r; If(left<pivot) Quicksort(elements,left,pivot-1); If(right>pivot) Quicksort(elements,pivot+1;right); }

FILE:
Void main() { FILE *fp; Int I; Clrscr(); Fp=fopen(data.dat,w+b); If(fp==NULL) { Pf(cannot open file); Exit(1); } Pf(\n enter int values); While(i!=0) { Sf(%d,&i); Putw(I,fp); } Rewind(fp); Pf(\n display int values); While(!feof(fp)) Pf(%d,getw(fp)); Getch(); }