#include <stdio.h> #define MAX 5 int queue[MAX]; int front = 0; int rear = -1; int count = 0; // Number of items in the queue void enqueue(int value) { if (count == MAX) { printf("Queue is full!\n"); return; } rear = (rear + 1) % MAX; queue[rear] = value; count++; } int dequeue() { if (count == 0) { printf("Queue is empty!\n"); return -1; } int value = queue[front]; front = (front + 1) % MAX; count--; return value; } int peek() { if (count == 0) { printf("Queue is empty!\n"); return -1; } return queue[front]; } // Returns 1 (true) if the queue is empty int isEmpty() { return count == 0; } int main() { enqueue(10); enqueue(20); enqueue(30); printf("Front item: %d\n", peek()); // Dequeue items until the queue is empty while (!isEmpty()) { printf("Dequeued: %d\n", dequeue()); } return 0; }