circularqueueusingarray.c

/* SOMASHRI RASTOGI */
#include<stdio.h>
#include<conio.h>
# define MAX 6
int CQ[MAX], front = 0,rear = 0,count = 0;
void insertCQ()
{
int data;
if(count == MAX)
{
    printf("Circular queue is full");

}
else
{
    printf("\n Enter data: ");
scanf("%d", &data);
CQ[rear] = data;
rear = (rear + 1) % MAX;
count ++;
printf("\n Data Inserted in the Circular Queue ");
}
}
void deleteCQ()
{
if(count == 0)
{
    printf("\n\nCircular Queue is Empty");
}
else
{
printf("\n Deleted element from Circular Queue is %d ", CQ[front]);
front = (front + 1) % MAX;
count --;
}
}
void display()
{
int i, j;
if(count == 0)
{
    printf("\n\n\t Circular Queue is Empty");
}
else
{
printf("\n Elements in Circular Queue are: ");
j = count;
for(i = front; j != 0; j--)
{
printf("%d\t", CQ[i]);
i = (i + 1) % MAX;
}
}
}
int menu()
{

    int ch;
printf("\n \t Circular Queue Operations using ARRAY..");
printf("\n 1. Insertion ");
printf("\n 2. Deletion ");
printf("\n 3. Display the Queue");
printf("\n 4. Quit ");
printf("\n Enter Your Choice: ");
scanf("%d", &ch);
return ch;
}
void main()
{

    int ch;
    do
    {
        ch = menu();
switch(ch)
{
case 1: insertCQ();
break;
case 2:  deleteCQ();
break;
case 3: display();
break;
case 4: return;
default: printf("Invalid choice");
}
getch();
    }
    while(1);

}