Question

When a circular queue is implemented in an array, then which of the following condition holds when there is only one element in the queue ?

a. front = rear = null
b. front = rear ≠ null
c. front = rear + 1
d. front = rear - 1

Answer 1

In a circular queue implemented in an array, when there is only one element in the queue, the condition that holds is front = rear ≠ null.

Step-by-step explanation:

When a circular queue is implemented in an array, the condition that holds when there is only one element in the queue is option b: front = rear ≠ null.

In a circular queue, the front pointer points to the first element of the queue, and the rear pointer points to the last element of the queue. When there is only one element in the queue, both the front and rear pointers will point to that element, indicating that the queue is not empty.

For example, if a circular queue is implemented in an array with five elements and the only element in the queue is 8, the front and rear pointers will both be 8, indicating that the queue is not empty.