// Program 41: Circular Queue import java.util.*; class CircularQueue { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int[] q = new int[5]; int front = -1, rear = -1, choice, item; do { System.out.println("1.Insert 2.Delete 3.Display 4.Exit"); choice = sc.nextInt(); if (choice == 1) { if ((rear + 1) % 5 == front) { System.out.println("Queue Overflow"); } else { System.out.print("Item: "); item = sc.nextInt(); if (front == -1) { front = 0; } rear = (rear + 1) % 5; q[rear] = item; } } else if (choice == 2) { if (front == -1) { System.out.println("Queue Underflow"); } else { System.out.println("Deleted: " + q[front]); if (front == rear) { front = rear = -1; } else { front = (front + 1) % 5; } } } else if (choice == 3) { if (front == -1) { System.out.println("Queue is empty"); } else { int i = front; while (true) { System.out.println(q[i]); if (i == rear) { break; } i = (i + 1) % 5; } } } } while (choice != 4); } }