Circular Queue Implementation Using Array in DSA C# - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is a circular queue and how does it differ from a regular queue?

A circular queue is a queue where the last position is connected back to the first position to make a circle. Unlike a regular queue, it efficiently uses space by reusing empty spots when elements are dequeued.

beginner

In a circular queue implemented with an array, what condition indicates the queue is full?

The queue is full when the next position of the rear pointer is the front pointer. Formally, (rear + 1) % size == front.

beginner

How do you calculate the next position of front or rear in a circular queue array?

You use modulo operation: (current_position + 1) % size_of_array. This wraps the pointer back to 0 when it reaches the end.

beginner

What happens when you dequeue an element from a circular queue?

The front pointer moves to the next position using (front + 1) % size, effectively removing the element at the front and making space reusable.

beginner

Why is a circular queue preferred over a simple queue when using arrays?

Because it avoids wasted space. In a simple queue, once rear reaches the end, no more elements can be added even if there is space at the front. Circular queue reuses that space.

What does the expression (rear + 1) % size == front signify in a circular queue?

A Queue is full

B Queue is empty

C Queue has one element

D Queue is partially full

This condition means the next position of rear is front, so the queue is full.

When dequeuing from a circular queue, how is the front pointer updated?

A front = front - 1

B front = (front + 1) % size

C front = rear

D front = 0

The front pointer moves forward circularly using modulo to wrap around.

Why can't a simple queue implemented with an array reuse space after dequeues?

A Because array size changes dynamically

B Because front pointer resets to zero

C Because rear pointer only moves forward and never wraps

D Because elements are copied after dequeue

In a simple queue, rear moves forward and does not wrap, so space at front is wasted.

What is the initial value of front and rear in an empty circular queue?

A -1

B 0

C size - 1

D 1

Both front and rear are set to -1 to indicate the queue is empty.

If front = 3, rear = 1, and size = 5 in a circular queue, is the queue empty, full, or partially filled?

A Invalid state

B Empty

C Full

D Partially filled

Since (rear + 1) % size = 2 != front (3), the queue is partially filled.

Explain how a circular queue uses an array to efficiently manage space compared to a simple queue.

Think about how pointers wrap around the array.

Describe the steps to enqueue and dequeue elements in a circular queue implemented with an array.

Focus on pointer updates and conditions.

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 efficiently uses the array space by reusing freed slots.

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

C. It automatically sorts the elements in the queue.

D. It increases the maximum size of the queue beyond the array length.

Solution

1. Step 1: Understand linear queue limitation

   In a linear queue using an array, once the 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

   A circular queue treats the array as circular, so when rear reaches the end, it wraps around to use empty slots at the front, efficiently using all available space.

3. Final Answer:

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

4. Quick Check:

   Circular queue reuses space = Advantage A [OK]

Hint: Circular queue reuses space freed at front [OK]

Common Mistakes:

• Thinking circular queue increases array size
• Believing it sorts elements automatically
• Assuming it stores different data types

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 indices?

easy

A. rear == n

B. rear == front

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

D. front == 0 && rear == n - 1

Solution

1. Step 1: Understand circular queue full condition

   In a circular queue, the queue is full when the next position of rear (circularly) is front.

2. Step 2: Express condition mathematically

   This means (rear + 1) modulo n equals front, ensuring no overlap and full queue detection.

3. Final Answer:

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

4. Quick Check:

   Full if next rear equals front = D [OK]

Hint: Full when next rear wraps to front [OK]

Common Mistakes:

• Using rear == front as full (actually empty)
• Checking rear == n ignoring wrap-around
• Using front == 0 && rear == n - 1 only (linear queue)

3. Consider a circular queue of size 5 (indices 0 to 4). Initially, front = 0 and rear = 3. After performing Enqueue(10) and Dequeue(), what are the values of front and rear?

medium

A. front = 0, rear = 4

B. front = 1, rear = 3

C. front = 0, rear = 3

D. front = 1, rear = 4

Solution

1. Step 1: Perform Enqueue operation

   Enqueue increments rear circularly: rear = (3 + 1) % 5 = 4.

2. Step 2: Perform Dequeue operation

   Dequeue increments front circularly: front = (0 + 1) % 5 = 1.

3. Final Answer:

   front = 1, rear = 4 -> Option D

4. Quick Check:

   Enqueue rear+1=4, Dequeue front+1=1 [OK]

Hint: Increment indices modulo size after enqueue/dequeue [OK]

Common Mistakes:

• Not wrapping indices with modulo
• Updating front on enqueue or rear on dequeue
• Confusing initial and final index values

4. Given this snippet of circular queue code, what is the error?

int n = 5;
int front = 0, rear = 0;
int[] queue = new int[n];

// Enqueue operation
rear = (rear + 1) % n;
queue[rear] = 10;

// Dequeue operation
front = (front + 1) % n;
int x = queue[front];

// Check if queue is empty
if (front == rear)
    Console.WriteLine("Queue is empty");

medium

A. The enqueue operation increments rear before inserting, causing off-by-one error.

B. The initial values of front and rear cause the first enqueue to overwrite data.

C. The empty check condition is incorrect; it should be (rear + 1) % n == front.

D. The dequeue operation should decrement front instead of incrementing.

Solution

1. Step 1: Analyze enqueue operation

   Incrementing rear before inserting means the first element is placed at index 1, skipping index 0, which wastes space and causes off-by-one errors.

2. Step 2: Understand correct enqueue logic

   Enqueue should insert at current rear, then increment rear after insertion or handle indices carefully to avoid skipping slots.

3. Final Answer:

   The enqueue operation increments rear before inserting, causing off-by-one error. -> Option A

4. Quick Check:

   Increment rear before insert = off-by-one error B [OK]

Hint: Insert before incrementing rear to avoid skipping slots [OK]

Common Mistakes:

• Confusing empty and full conditions
• Incrementing front on enqueue or rear on dequeue
• Ignoring initial index positions

5. You have a circular queue of size 6. Initially, front = 4 and rear = 2. The queue currently holds 4 elements. Which of the following sequences of operations will cause the queue to become full?

hard

A. Enqueue three times, then dequeue once, then enqueue once.

B. Dequeue once, then enqueue three times.

C. Enqueue three times without any dequeue.

D. Dequeue twice, then enqueue five times.

Solution

1. Step 1: Calculate current queue state

   Size is 6, front=4, rear=2, holding 4 elements means the queue is partially filled with wrap-around.

2. Step 2: Analyze each operation sequence

   A: Dequeue once (remove 1), enqueue three times (add 3) -> net +2 elements, total 6 (full). B: Enqueue three times (add 3), dequeue once (remove 1), enqueue once (add 1) -> net +3 elements, total 7 (overflow). C: Enqueue three times without dequeue would overflow (since only 2 slots free). D: Dequeue twice (remove 2), enqueue five times (add 5) -> net +3 elements, total 7 (overflow).

3. Step 3: Identify which sequence is valid without overflow

   Only Dequeue once, then enqueue three times. correctly balances operations to reach full without overflow errors.

4. Final Answer:

   Dequeue once, then enqueue three times. -> Option B

5. Quick Check:

   Dequeue 1 + Enqueue 3 fills queue = A [OK]

Hint: Track net enqueue minus dequeue to reach full capacity [OK]

Common Mistakes:

• Ignoring wrap-around effect on indices
• Assuming enqueue always succeeds without checking full
• Miscounting elements after operations