6. 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...

Extracted text: 6. 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: Full: (REAR+1) mod n == empty: (FRONT+1) mod n == REAR FRONT, Full: (REAR+1) mod n == FRONT, empty: REAR == FRONT Full: (FRONT+1) mod n == REAR, empty: REAR == FRONT Full: REAR == FRONT, empty: (REAR+1) mod n == FRONT