A circular queue is implemented using an array of size n and the pointers,…

A circular queue is implemented using an array of size n and the pointers, front and rear points to the first and last element of the queue respectively. This circular queue is full when :

  1. A.

    front = rear + 1

  2. B.

    rear = front + 1

  3. C.

    rear = (front +1) mod n

  4. D.

    front = (rear + 1) mod n

Attempted by 334 students.

Sign up free to check your answer

Sign up free

Explore the full course: Up Lt Grade Assistant Teacher 2025

Loading lesson…