Question 8839 – Data-Structures

Suppose a circular queue of capacity (n – 1) elements is implemented with an array of n elements. Assume that the insertion and deletion operations are carried out using REAR and FRONT as array index variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue full and queue empty are

Correct Answer: A

To circulate within the queue we have to write mod n for (Rear + 1).
We insert elements using Rear & delete through Front.