Which condition represents a full circular queue of size N when one position is kept empty?

Options

  • A. Front = Rear
  • B. Rear = N - 1
  • C. (Rear + 1) % N = Front
  • D. More than one of the above
  • E. None of the above

Correct Answer (Detailed Explanation is Below)

C. (Rear + 1) % N = Front

Detailed Explanation

In a circular queue with one position intentionally kept empty, the queue is full when (Rear + 1) % N = Front. The modulo operator allows the rear pointer to wrap around to the beginning of the array. This is one of the most important circular queue conditions for competitive examinations. The empty condition is commonly represented by Front = Rear, depending on the implementation.

← Previous Next →

Attempt Quiz Now:

BPSC TRE 4 DSA Practice set 1

Feature Posts