#include <stdio.h>
#define SIZE 5
int myqueue[SIZE];
int front = -1, rear = -1;
void enQueue(int value)
{
if (rear == SIZE - 1)
printf("\nQueue is Full.. \n\n");
else
{
rear++;
myqueue[rear] = value;
printf("\nInserted : %d \n\n", value);
if (front == -1)
{
front = 0;
}
}
}
void deQueue()
{
if (front == -1)
printf("\nQueue is Empty!!\n");
else
{
printf("\nItem Deleted : %d \n", myqueue[front]);
front++;
if (front > rear)
{
front = -1;
rear = -1;
}
}
}
void display()
{
if (front == -1)
printf("\nQueue is Empty!!!");
else
{
int i = front;
printf("\nQueue elements are:\n");
while (i <= rear)
{
printf("%d ", myqueue[i]);
i++;
}
}
printf("\n");
}
void length()
{
int count = 0;
int i = front;
if (front == -1)
{
printf("Queue is Empty..\n");
}
else
{
while (i <= rear)
{
count++;
i++;
}
printf("Length is : %d \n", count);
}
}
void main()
{
int choice;
int item, len;
clrscr();
while (1)
{
printf("1. enQueue. \n");
printf("2. deQueue. \n");
printf("3. Display. \n");
printf("4. Length. \n");
printf("0. Exit. \n");
printf("Enter Your Choice : ");
scanf("%d", &choice);
switch (choice)
{
case 1:
printf("Enter Element to enQueue : ");
scanf("%d", &item);
enQueue(item);
break;
case 2:
deQueue();
break;
case 3:
display();
break;
case 4:
length();
break;
case 0:
exit(0);
default:
printf("Invalid Choice. \n\n");
}
}
}