#include
using namespace std;
const int N = 5;
int Queue[N];
int rear = -1;
int frnt = -1;
void enqueue(int x)
{
if (rear == N - 1)
{
cout << "Overflow" << endl;
}
else if (rear == -1 && frnt == -1)
{
rear = frnt = 0;
Queue[rear] = x;
}
else
{
rear++;
Queue[rear] = x;
}
}
void dequeue()
{
if (frnt == -1)
{
cout << "Queue is empty" << endl;
}
else
{
cout << "Dequeued value: " << Queue[frnt] << endl;
if (frnt == rear)
{
frnt = rear = -1;
}
else
{
frnt++;
}
}
}
void peek()
{
if (frnt == -1)
{
cout << "Queue is empty" << endl;
}
else
{
cout << "The front value of this queue is: " << Queue[frnt] << endl;
}
}
void display()
{
if (frnt == -1)
{
cout << "Queue is empty" << endl;
}
else
{
cout << "Queue elements: ";
for (int i = frnt; i <= rear; i++)
{
cout << Queue[i] << " ";
}
cout << endl;
}
}
int main()
{
int opt;
do
{
cout << "Choose any option: " << endl;
cout << "1: Enqueue." << endl;
cout << "2: Dequeue." << endl;
cout << "3: Peek." << endl;
cout << "4: Display." << endl;
cout << "0: Exit." << endl;
cin >> opt;
switch (opt)
{
case 1:
int x;
cout << "Enter value to enqueue: ";
cin >> x;
enqueue(x);
break;
case 2:
dequeue();
break;
case 3:
peek();
break;
case 4:
display();
break;
case 0:
cout << "Exiting program." << endl;
break;
default:
cout << "Invalid Option." << endl;
}
} while (opt != 0);
return 0;
}
Comments