/*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; …
/*PROGRAM TO DELETE AN ELEMENT FROM Kth POSITION IN THE ARRAY*/ #include<conio.h> #include<iostream.h> #define MAX 10 void main() { int p,i,a[MAX],n=0,num; char ch; clrscr(); cout<<“Inserting elements in the array:”<<endl; do …
/*PROGRAM TO DELETE A SPECIFIC ELEMENT FROM THE 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,item; char …
/*PROGRAM TO INSERT AN ELEMENT IN THE BEGINING OF DOUBLY LINKED LIST*/ #include<conio.h> #include<iostream.h> struct node { int data; struct node *flink,*plink; }; void main() { struct node *start=NULL,*ptr,*temp,*ptr1; int …
/*PROGRAM TO INSERT AN ELEMENT IN THE BEGINING OF DOUBLY LINKED LIST*/ #include<conio.h> #include<iostream.h> struct node { int data; struct node *flink,*plink; }; void main() { struct node *start=NULL,*ptr,*temp,*ptr1; int …
/*PROGRAM TO INSERT AN ELEMENT AT THE END OF DOUBLY LINKED LIST*/ #include<conio.h> #include<iostream.h> struct node { int data; struct node *flink,*plink; }; void main() { struct node *start=NULL,*ptr,*temp,*ptr1; int …
/*PROGRAM TO IMPLEMENT SEARCH OPERATION 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,num,count=0; char ch; clrscr(); do { if(rear>=MAX-1) { cout<<“Queue is …
/*PROGRAM TO DELETE AN ELEMENT FROM THE END OF DOUBLY LINKED LIST*/ #include<conio.h> #include<iostream.h> struct node { int data; struct node *flink,*plink; }; void main() { struct node *start=NULL,*ptr,*temp,*ptr1; int …
