PadhaikoAll subjects

Past exam question: 2076 Baisakh (Back), Q3

Data Structure and Algorithms · 5 marks

Open in the Padhaiko app

Topic: Queues

Question

Differentiate linear queue and circular queue with suitable example.

Solution

Linear Queue vs. Circular Queue:

AspectLinear QueueCircular Queue
Index Progressionrear = rear + 1, front = front + 1rear = (rear + 1) % MAX, front = (front + 1) % MAX
Memory ReuseFreed slots at 0..front-1 cannot be reusedFreed slots before front are reused via wrap-around
Full Conditionrear == MAX - 1 (even when front > 0)(rear + 1) % MAX == front
False OverflowOccurs frequently after enqueues and dequeuesEliminated completely

Illustrative Example (MAX = 4): Enqueue 10, 20, 30, 40 front=0, rear=3. Now dequeue() twice removes 10, 20 front=2, rear=3 (slots 0 and 1 are empty!).

Answer:

A linear queue stops accepting elements once rear == MAX - 1 even if earlier dequeues freed front slots (false overflow), whereas a circular queue wraps rear and front around using % MAX so freed slots are reused immediately.

All past exam questions for Data Structure and Algorithms