Suppose a circular queue of capacity (n – 1) elements is implemented with an array of n elements. Assume that the insertion and deletion operation 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

Mr. Dubey • 52.30K Points
Coach

Q. Suppose a circular queue of capacity (n – 1) elements is implemented with an array of n elements. Assume that the insertion and deletion operation 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

(A) full: (rear+1) mod n == front, empty: rear == front

(B) full: (rear+1) mod n == front, empty: (front+1) mod n == rear

(D) full: (front+1) mod n == rear, empty: rear == front

Correct : Option (A)