Past exam question: 2072 Ashwin (Regular), Q3
Open in the Padhaiko appQuestion
Define a queue. Explain enqueue and dequeue operation in circuit queue.
Solution
Definition of Queue: A queue is a FIFO (First-In, First-Out) linear data structure where insertions (enqueue) occur at rear and deletions (dequeue) occur at front.
Enqueue and Dequeue in Circular Queue (Q[0..MAX-1], initially front = rear = -1):
enqueue(val):- Full check: If
(rear + 1) % MAX == front, report Overflow. - Empty case: If
front == -1, setfront = 0, rear = 0. - General case: Otherwise set
rear = (rear + 1) % MAX. - Store
Q[rear] = val.
- Full check: If
dequeue():- Empty check: If
front == -1, report Underflow. - Save
val = Q[front]. - Single element (
front == rear): Resetfront = -1, rear = -1. - General case: Advance
front = (front + 1) % MAX. - Return
val.
- Empty check: If
Answer:
A queue is a FIFO structure. In a circular queue, enqueue advances rear = (rear + 1) % MAX (after checking (rear + 1) % MAX == front), and dequeue advances front = (front + 1) % MAX (resetting to -1 when emptying the last item).