Program to create a Circular Queue

#include
#include
#define MAX 5
struct queue
{
int f,r;
int x[MAX];
}q;
void disp(struct queue *p)
{
int i;
puts("\n\t\tQueue\n");
if(p->f>p->r)
{
for(i=p->f;i<MAX-1;i++)
printf("\t%d",p->x[i]);
for(i=0;i<=p->r;i++)
printf("\t%d",p->x[i]);
}
else
{
for(i=p->f;i<=(p->r-1);i++)
printf("\t%d",p->x[i+1]);
}
printf("\n\n\n\n");
}
void main()
{
int choice;
int x[MAX],n;
clrscr();
q.f=0;
q.r=0;
do
{
printf("\t\tCircular queue\n");
printf("\n1-Insert\n2-Delete\n3-Display\n4-Exit");
printf("\nThe selected option:");
scanf("%d",&choice);
switch(choice)
{
case 1:
if((q.f==0 && q.r==MAX-1)||((q.f==q.r+1)&&(q.r>1)))
printf("Queue is full\n");
else
{
q.r=(q.r+1)%MAX;
puts("\n\nEnter no.:");
scanf("%d",&n);
q.x[q.r]=n;
}
break;
case 2:if(q.r==q.f)   puts("Queue is empty");
else
{
q.f=(q.f+1)%MAX;
printf("\n\n\nDeleted element is %d\n\n",q.x[q.f]);
}
break;
case 3:
disp(&q);
break;
case 4:break;
}
}
while(choice!=4);
}

OUTPUT:

Circular queue

1-Insert
2-Delete
3-Display
4-Exit
The selected option:1

Enter no.:
10
Circular queue

1-Insert
2-Delete
3-Display
4-Exit
The selected option:1

Enter no.:
20
Circular queue

1-Insert
2-Delete
3-Display
4-Exit

OUTPUT:

The selected option:1

Enter no.:
30
Circular queue

1-Insert
2-Delete
3-Display
4-Exit
The selected option:3

Queue

10      20      30

Circular queue

1-Insert
2-Delete
3-Display
4-Exit
The selected option:2

Deleted element is 10

Circular queue

1-Insert
2-Delete
3-Display
4-Exit
The selected option:4

Related posts:

1. Program to create a Circular Queue #include<stdio.h> #include<conio.h> #define MAX 5 struct queue { int f,r; int x[MAX]; }q; void disp(struct queue *p) { int i; puts(“\n\t\tQueue\n”); if(p->f>p->r) { for(i=p->f;i<MAX-1;i++) printf(“\t%d”,p->x[i]);...
2. Program to create a Single Linked List #include #include #include struct node { int data; struct node*next; }*start; void create_list(int n); void addafter(int n,int pos); void display(); void search(int n); void del(int...
3. Program to sort names or strings in C #include #include #include main() { char a[10][20],temp[12]; int i,j; clrscr(); printf("Enter the names\n"); for(i=0;i<10;i++) { scanf("%s",&a[i]); } printf("\n"); for(i=0;i<9;i++) { for(j=0;j<9;j++) { if(strcmp(a[j],a[j+1])>0) { strcpy(temp,a[j]);...
4. JavaScript innerHTML I was going through a few tutorials for AJAX and I found out about a javascript property I hadn’t heard before.Its called innerHTML. innerHTML is...

Tags: a-circular-queue-n, abstract-for-circular-queue, abstractioiotabactivity, android-circular-queue, android-market-tabactivity, android-tabactivity, android-tabactivity-circular-queue, Circular Queue, circular-q-program, circular-queue-in-android, circular-queue-insert-and-delete, circular-queue-program, circular-queues-in-java, circularqueue, circularqueueimages, how-to-insert-and-delete-in-circular-queue, image-of-circular-queue, pictureofcircularqueue, Program to create in C, what-is-circular-queue

Category: C/C++, Coder's Club