Below C program implements various Circular Queue operations
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 | #include<stdio.h> #define max 3 int q[10],front=0,rear=-1; void main() { int ch; void insert(); void delet(); void display(); clrscr(); printf("\nCircular Queue operations\n"); printf("1.insert\n2.delete\n3.display\n4.exit\n"); while(1) { printf("Enter your choice:"); scanf("%d",&ch); switch(ch) { case 1: insert(); break; case 2: delet(); break; case 3:display(); break; case 4:exit(); default:printf("Invalid option\n"); } } } void insert() { int x; if((front==0&&rear==max-1)||(front>0&&rear==front-1)) printf("Queue is overflow\n"); else { printf("Enter element to be insert:"); scanf("%d",&x); if(rear==max-1&&front>0) { rear=0; q[rear]=x; } else { if((front==0&&rear==-1)||(rear!=front-1)) q[++rear]=x; } } } void delet() { int a; if((front==0)&&(rear==-1)) { printf("Queue is underflow\n"); getch(); exit(); } if(front==rear) { a=q[front]; rear=-1; front=0; } else if(front==max-1) { a=q[front]; front=0; } else a=q[front++]; printf("Deleted element is:%d\n",a); } void display() { int i,j; if(front==0&&rear==-1) { printf("Queue is underflow\n"); getch(); exit(); } if(front>rear) { for(i=0;i<=rear;i++) printf("\t%d",q[i]); for(j=front;j<=max-1;j++) printf("\t%d",q[j]); printf("\nrear is at %d\n",q[rear]); printf("\nfront is at %d\n",q[front]); } else { for(i=front;i<=rear;i++) { printf("\t%d",q[i]); } printf("\nrear is at %d\n",q[rear]); printf("\nfront is at %d\n",q[front]); } printf("\n"); } getch(); |
i am very glad to get online advice..
the program is quite understandable easily
This program is very easy to understand the concepts thanks.
display func will not work when u add one element in queue and thn u delete it….only one element
good implementation.. and also good logic
thank you..
I want pseudo code for the problem in data structure…. Circular queue implementation…
thank you so much…u are doing such a nice work helping needy student…love ur site 🙂
Good and easy one..
Nice program.
r u sure about “getch();”
#include
#include
#include
# define max 3
int front=0,rear=-1;
int cq[max],count=0;
void cqinsert()
{
int ele;
if(count==max)
{
printf(“cq is full\n”);
return;
}
printf(“enter the element\n”);
scanf(“%d”,&ele);
rear=(rear+1)%max;
cq[rear]=ele;
count++;
}
void cqdelete()
{
if(count==0)
{
printf(“cq is empty\n”);
return;
}
printf(“element deleted is %d”,cq[front]);
front =(front+1)%max;
count–;
}
void cqdisplay()
{
int j=front,i;
if(count==0)
{
printf(“cq is empty\n”);
return;
}
for(i=1;i<=count;i++)
{
printf("%d\t",cq[j]);
j=(j+1)%max;
}
}
void main()
{
int ch;
clrscr();
printf("1:insert 2:delete 3:display default :exit\n");
do
{
printf("enter choice\n");
scanf("%d",&ch);
switch(ch)
{
case 1: cqinsert();
break;
case 2: cqdelete();
break;
case 3: cqdisplay();
break;
case 4: exit(0);
}
}while(ch<=4) ;
getch();
}
this program works for all the cases