//Implementation of a queue as a circular array

#include<iostream.h>
#include<conio.h>
#include<process.h>
const int max=5;
void main()
{
clrscr();
int q[max],front=-1,rear=-1,ch,num;
menu:
cout<<"\n\nMenu\n1.Push\n2.Pop\n3.Traverse\n4.Exit\nEnter Your Choice:";
cin>>ch;
switch(ch)
{
case 1:
if(front==(rear+1)%max)
cout<<"Queue Overflow";
else if(front==-1&&rear==-1)
{
front=0;
rear=0;
cout<<"Enter the number:";
cin>>num;
q[front]=num;
}
else
{
rear=(rear+1)%max;
cout<<"\nEnter the number:";
cin>>num;
q[rear]=num;
}
break;
case 2:
if(front==-1&&rear==-1)
cout<<"\nQueue does not exist";
else if(front==rear)
{
num=q[front];
cout<<"\nThe deleted number:"<<num;
front=-1;
rear=-1;
}
else
{
num=q[front];
cout<<"\nThe deleted number is:"<<num;
front=(front+1)%max;
}
break;
case 3:
if(front==-1&&rear==-1)
cout<<"\nQueue does not exist";
else
{
for(int i=front;i!=rear;i=(i+1)%max)

cout<<q[i]<<" ";
cout<<q[rear]<<endl;
}
break;
case 4:
getch();
exit(0);
default:
cout<<"Wrong Choice,Please Re-Enter:";
}
goto menu;
}
//OUTPUT
Menu
1.Push
2.Pop
3.Traverse
4.Exit
Enter Your Choice:1
Enter the number:1
Menu
1.Push
2.Pop
3.Traverse
4.Exit
Enter Your Choice:1
Enter the number:2
Menu
1.Push
2.Pop
3.Traverse
4.Exit
Enter Your Choice:1
Enter the number:3
Menu
1.Push
2.Pop
3.Traverse
4.Exit
Enter Your Choice:1
Enter the number:4
Menu
1.Push
2.Pop
3.Traverse
4.Exit
Enter Your Choice:1
Enter the number:5
Menu
1.Push
2.Pop

3.Traverse
4.Exit
Enter Your Choice:1
Queue Overflow
Menu
1.Push
2.Pop
3.Traverse
4.Exit
Enter Your Choice:2
The deleted number is:1
Menu
1.Push
2.Pop
3.Traverse
4.Exit
Enter Your Choice:3
2345
Menu
1.Push
2.Pop
3.Traverse
4.Exit
Enter Your Choice:1
Enter the number:1
Menu
1.Push
2.Pop
3.Traverse
4.Exit
Enter Your Choice:3
23451
Menu
1.Push
2.Pop
3.Traverse
4.Exit
Enter Your Choice:4