#include <stdio.

h>

#define size 5
int queue[size];
int front = -1, rear = -1;
void enqueue();
void dequeue();
void display();
int main()
{
int choice;
while(1)
{
printf("Enter The choice\n");
printf("1. enqueue\n");
printf("2. dequeue\n");
printf("3. display\n");
printf("4. exit\n");
scanf("%d",&choice);
switch (choice)
{
case 1:
enqueue();
break;
case 2:
dequeue();
break;
case 3:
display();
break;
case 4:
exit (0);
}
}
}

void enqueue()
{
if (front==-1 && rear == -1)
{
printf("Enter element to enqueue\n");
front = rear = 0;
scanf("%d",&queue[rear]);
}
 else if (((rear+1)%size) == front)
printf("queue overflow\n");
else
{
printf("Enter element to enqueue\n");
rear = ((rear+1)%size);
scanf("%d",&queue[rear]);
}
}
void dequeue()
{
if (front==-1 && rear == -1)
printf("queue underflow\n");
else if (front == rear)
{
printf("the dequeue element is %d\n", queue[front]);
front = rear = -1;
}
else
{
printf("the dequeue element is %d\n", queue[front]);
front = ((front+1)%size);
}
}
void display()
{
int i = front;
if (front == -1 && rear == -1)
printf("queue underflow\n");
else
{
printf("queue is: \n");
printf("| ");
while (i!=rear)
{
printf("%d | ",queue[i]);
i=((i+1)%size);
}
printf("%d |\n",queue[rear]);
}
}