#include <stdio.h> #include <stdlib.h> #define SIZE 5 int front = -1; int rear = -1; int Q[SIZE]; void enqueue(); void dequeue(); void show(); int main () { int choice; while (1) { printf("\nEnter 1 for enqueue\n"); printf("Enter 2 for dequeue\n"); printf("Enter 3 to see the Queue Elements\n"); printf("Enter 4 to Quit\n"); printf("\nEnter Your Choice: "); scanf("%d", &choice); switch (choice) { case 1: enqueue(); break; case 2: dequeue(); break; case 3: show(); break; case 4: exit(0); default: printf("\nWrong choice\n"); } } return 0; } void enqueue() { int val; if (rear == SIZE - 1) printf("\nQueue is Full."); else { if (front == -1) front = 0; printf("\nInsert the value: "); scanf("%d", &val); rear = rear + 1; Q[rear] = val; } } void dequeue() { if (front == -1 || front > rear) printf("\nQueue Is Empty."); else { printf("\nDeleted Element is %d", Q[front]); front = front + 1; } } void show() { if (front == rear == -1 || front > rear) { printf("\nQueue is Empty."); } else { for (int i = front; i <= rear; i++) printf("%d\t", Q[i]); } }