#include<stdio.

h>
#define maxsize 5
void enqueue();
void dequeue();
void display();
int front = -1, rear = -1;
int queue[maxsize];
void main ()
{
int choice;
while(choice != 4)
{
printf("\nQUEUE OPERATIONS:");
printf("1.Enqueue\t2.Dequeue\t3.Display\t4.Exit");
printf("\n-----------------------------\n");
printf("Enter your choice:");
scanf("%d",&choice);
switch(choice)
{
case 1:
enqueue();
break;
case 2:
dequeue();
break;
case 3:
display();
 break;
case 4:
printf("\nexiting.....");
exit(0);
break;
default:
printf("\nEnter valid choice !\n");
}
}
}
void enqueue()
{
int val;

if(rear == maxsize-1)
printf("\nOVERFLOW\n");
else
{
if(front == -1 && rear == -1)
front=rear=0;
else
rear = rear+1;
printf("\nEnter the element:");
scanf("%d",&val);
queue[rear] = val;
printf("\nValue inserted ");
}
}
void dequeue()
{
int val;
if (front == -1 || front > rear)
{
printf("\nUNDERFLOW\n");
}
else
{
val = queue[front];
if(front == rear)
{
front = -1;
rear = -1 ;
}
else
{
front = front + 1;
}
printf("\nvalue deleted ");
}
}

void display()
{
int i;
 if(rear == -1)
{
printf("\nQueue is empty\n");
}
else
{ printf("\nValues in Queue are:");
for(i=front;i<=rear;i++)
{
printf("%d\t",queue[i]);
}
}
}