********DATA STRUCTURE******

**SUBMITED BY:**

*SAVERA KHURSHID

*FATIMA FAROQUI

*SANA YONUS

SUBMITED TO:

MEM NARMEEN

PROGRAMES OF DATA STRUCTURE

PROGRAME

TRAVERSING AN ARRAY

#include

#include

main()

{

int la[]={0,1,2,3,4,5};

int k ,ub=5,lb=0;

clrscr();

for(k=lb;k=k)

{

la[j+1]=la[j];

j=j-1;

}

la[k]=a;

for(b=0;b%d",a,b);tower(n-1,c,b,a);}}

PROGRAMME:

QUES

#include#includevoid ins(void);void del(void);

int front=-1,rear=-1,queue[5];main(){

char ch;char op;clrscr();while(ch=='N'){printf("\n\nto continue program press 'y'&terminate press 'N'");ch=getche();if(ch=='y'){printf("\nchoose 'i' for insertion and choose 'd' for deletion");op=getche();switch(op){case 'i':{ins();}break;case 'd':{del();}break;}}}}void ins(void){if(rear==4){printf("overflow");}else{printf("after insertion an queue %d",queue[rear++]);printf("\nfront=%d,rear=%d",front,rear);}}void del(void){if(front==rear){printf("underflow");}else{printf("after deletion from que %d",queue[front++]);printf("\nfront=%d,rear=%d,front,rear");}}

PROGRAMME OF PATTERN MATCHING