Why Circular Queue Implementation Using Array in DSA C++?

The Big Idea

What if your queue could magically reuse empty spots without moving anything?

The Scenario

Imagine you have a small parking lot with limited spaces arranged in a circle. Cars come in and leave, but if you only let cars park in a straight line without reusing empty spots at the start, the lot fills up quickly even if some spots are free.

The Problem

Using a simple queue with an array means once the end is reached, you cannot add more cars even if there are empty spots at the beginning. This wastes space and forces you to shift all cars forward manually, which is slow and tiring.

The Solution

A circular queue treats the array like a circle, so when you reach the end, you wrap around to the start if there is space. This way, you reuse empty spots efficiently without shifting elements, making the process smooth and fast.

Before vs After

✗ Before

int rear = -1;
int front = 0;
// Enqueue
if (rear == size - 1) {
  // Can't add more even if front > 0
}

✓ After

int rear = -1;
int front = 0;
// Enqueue
rear = (rear + 1) % size;
// Add element at rear

What It Enables

This lets you use fixed-size arrays efficiently for queues, saving memory and speeding up operations without complex shifting.

Real Life Example

Think of a roundabout where cars enter and leave continuously. The circular queue helps manage cars entering and exiting smoothly without blocking the road.

Key Takeaways

Simple queues waste space when implemented with arrays.

Circular queues reuse space by wrapping around the array.

This improves efficiency and performance for fixed-size queues.

Practice

1. What is the main advantage of using a circular queue over a simple linear queue when implemented using an array?

easy

A. It eliminates the need for front and rear pointers

B. It allows storing different data types in the same queue

C. It automatically sorts the elements in the queue

D. It efficiently uses the array space by reusing freed slots

Solution

1. Step 1: Understand linear queue limitation

   In a linear queue using an array, once rear reaches the end, no more elements can be added even if there are empty slots at the front.

2. Step 2: Circular queue advantage

   Circular queue connects the end of the array back to the front, allowing reuse of empty slots freed by dequeuing.

3. Final Answer:

   It efficiently uses the array space by reusing freed slots -> Option D

4. Quick Check:

   Space reuse = Advantage [OK]

Hint: Circular queue reuses space freed by dequeued elements [OK]

Common Mistakes:

• Thinking circular queue sorts elements
• Believing circular queue removes need for pointers
• Assuming it supports multiple data types inherently

2. Which of the following is the correct condition to check if a circular queue is full when using an array of size n with front and rear pointers?

easy

A. front == (rear + 1) % n

B. rear == n - 1

C. front == rear

D. rear == (front + 1) % n

Solution

1. Step 1: Understand full condition in circular queue

   In circular queue, queue is full when next position of rear is front, i.e., (rear + 1) modulo n equals front.

2. Step 2: Match condition with options

   front == (rear + 1) % n matches this condition: front == (rear + 1) % n.

3. Final Answer:

   front == (rear + 1) % n -> Option A

4. Quick Check:

   Full condition = front == (rear + 1) % n [OK]

Hint: Full when front is next to rear in circular manner [OK]

Common Mistakes:

• Using rear == n - 1 which is for linear queue
• Confusing front == rear as full (actually empty)
• Swapping front and rear in condition

3. Consider a circular queue of size 5 (indices 0 to 4). Initially, front = -1 and rear = -1. After the following operations:
enqueue(10); enqueue(20); enqueue(30); dequeue(); enqueue(40); enqueue(50); dequeue(); enqueue(60);
What will be the values of front and rear?

medium

A. front = 2, rear = 1

B. front = 2, rear = 0

C. front = 3, rear = 0

D. front = 1, rear = 4

Solution

1. Step 1: Trace each operation and update pointers

   Start: front = -1, rear = -1
   enqueue(10): front=0, rear=0
   enqueue(20): rear=1
   enqueue(30): rear=2
   dequeue(): front=1
   enqueue(40): rear=3
   enqueue(50): rear=4
   dequeue(): front=2
   enqueue(60): rear=(4+1)%5=0

2. Step 2: Final pointer values

   front = 2, rear = 0 which corresponds to front = 2, rear = 0.

3. Final Answer:

   front = 2, rear = 0 -> Option B

4. Quick Check:

   Trace pointers carefully [OK]

Hint: Track front and rear after each enqueue/dequeue [OK]

Common Mistakes:

• Not updating rear circularly after last index
• Confusing front and rear updates on dequeue
• Ignoring initial front = -1 condition

4. The following code snippet is part of a circular queue implementation. Identify the bug:

void enqueue(int value) {
  if ((rear + 1) % size == front) {
    cout << "Queue is full" << endl;
    return;
  }
  if (front == -1) front = 0;
  rear = (rear + 1) % size;
  arr[rear] = value;
}

medium

A. No bug, code is correct

B. The front pointer should be updated after rear

C. The initial check for empty queue should be before full check

D. The condition to check full queue is incorrect

Solution

1. Step 1: Analyze full queue condition

   The condition (rear + 1) % size == front correctly checks if queue is full in circular queue.

2. Step 2: Check front pointer update and enqueue steps

   If queue is empty (front == -1), front is set to 0 before inserting.
   rear is updated circularly and value inserted at arr[rear].

3. Final Answer:

   No bug, code is correct -> Option A

4. Quick Check:

   Full check and pointers update are correct [OK]

Hint: Full check uses modulo; front updated only if empty [OK]

Common Mistakes:

• Misplacing front update after rear
• Incorrect full condition without modulo
• Checking empty after full condition

5. You have a circular queue of size 6. After performing the following operations:
enqueue(5); enqueue(10); enqueue(15); dequeue(); dequeue(); enqueue(20); enqueue(25); enqueue(30); enqueue(35);
What will be the sequence of elements in the queue from front to rear?

hard

A. 20 -> 25 -> 30 -> 35

B. 10 -> 15 -> 20 -> 25 -> 30 -> 35

C. 15 -> 20 -> 25 -> 30 -> 35

D. 5 -> 10 -> 15 -> 20 -> 25 -> 30

Solution

1. Step 1: Trace each operation and queue content

   Start empty.
   enqueue(5): queue = [5]
   enqueue(10): queue = [5,10]
   enqueue(15): queue = [5,10,15]
   dequeue(): removes 5, queue = [10,15]
   dequeue(): removes 10, queue = [15]
   enqueue(20): queue = [15,20]
   enqueue(25): queue = [15,20,25]
   enqueue(30): queue = [15,20,25,30]
   enqueue(35): queue = [15,20,25,30,35]

2. Step 2: Check queue size and elements

   Queue size is 6, current elements are 5.
   From front to rear: 15 -> 20 -> 25 -> 30 -> 35

3. Final Answer:

   15 -> 20 -> 25 -> 30 -> 35 -> Option C

4. Quick Check:

   After dequeues, front moves; final elements start from 15 [OK]

Hint: Remove dequeued elements, then list remaining from front to rear [OK]

Common Mistakes:

• Forgetting to remove dequeued elements
• Listing elements before dequeue operations
• Assuming queue is full and ignoring last enqueue