/*PROGRAM TO INSERT ELEMENTS IN CIRCULAR QUEUE*/ #include<conio.h> #include<iostream.h> #include<stdlib.h> #define MAX 5 void main() { int front=-1,rear=-1,i,a[MAX],item; char ch; clrscr(); do { if((front==0 && rear==MAX-1)||(front==rear+1)) { cout<<“Queue is full”<<endl; …
/*PROGRAM TO INSERT ELEMENTS AT THE END OF LINKED LIST*/ #include<conio.h> #include<iostream.h> struct node { int data; struct node *link; }; void main() { struct node *start=NULL,*ptr,*temp; int num; char …
/*PROGRAM TO INSERT AN ELEMENT AT POSITION K IN THE ARRAY*/ #include<conio.h> #include<iostream.h> #define MAX 10 void main() { int p,i,a[MAX]={2,3,4,5},n=4,num; char ch; clrscr(); cout<<“Currently elements in the array are: …
/*PROGRAM TO IMPLEMENT SEARCH OPERATION IN CIRCULAR QUEUE*/ #include<conio.h> #include<iostream.h> #include<stdlib.h> #define MAX 5 void main() { int front=-1,rear=-1,i,a[MAX],item,c=0; char ch; clrscr(); cout<<“Inserting elements in the queue:”<<endl; do { if((front==0 …
/*PROGRAM TO IMPLEMENT INVERSE OF STACK USING LINKED LIST*/ #include<conio.h> #include<iostream.h> struct node { int data; struct node *link; }; void main() { struct node *top=NULL,*ptr,*temp,*start=NULL,*temp1; int num; char ch; …
/*PROGRAM TO IMPLEMENT INVERSE OF STACK USING ARRAY*/ #include<conio.h> #include<iostream.h> #include<stdlib.h> #define MAX 5 void main() { int maxstk,top=-1,n,a[MAX],i; char ch; clrscr(); //PUSH OPERATION do { if(top>=MAX-1) { cout<<“Stack is …
/*PROGRAM TO IMPLEMENT INSERTION IN A QUEUE USING ARRAY*/ #include<conio.h> #include<iostream.h> #include<stdlib.h> #define MAX 5 void main() { int i,a[MAX],rear=-1,n; char ch; clrscr(); do { if(rear>=MAX-1) { cout<<“Queue is full”<<endl; …
/*PROGRAM TO IMPLEMENT DELETION IN A QUEUE USING ARRAY*/ #include<conio.h> #include<iostream.h> #include<stdlib.h> #define MAX 5 void main() { int i,a[MAX],rear=-1,front=-1,n; char ch; clrscr(); do { if(rear>=MAX-1) { cout<<“Queue is full”<<endl; …
/*PROGRAM TO DELETE ELEMENTS FROM CIRCULAR QUEUE USING ARRAY*/ #include<conio.h> #include<iostream.h> #include<stdlib.h> #define MAX 5 void main() { int front=-1,rear=-1,i,a[MAX],item; char ch; clrscr(); do { if((front==0 && rear==MAX-1)||(front==rear+1)) { cout<<“Queue …
/*PROGRAM TO DELETE AN ELEMENT FROM THE END OF LINKED LIST*/ #include<conio.h> #include<iostream.h> struct node { int data; struct node *link; }; void main() { struct node *start=NULL,*ptr,*temp,*ptr1,*ptr2; int num; …
