Suppose a circular queue of capacity (n-

Question

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
(C) Full: REAR == FRONT, empty: (REAR+1) mod n == = FRONT
(D) Full: (FRONT+1) mod n == REAR, empty: REAR FRONT
==
==
==

Kunduz · Accepted Answer

Explanation with an example:
Suppose we start filling the queue
Let ManQueue Size be 4
" Size of
Away
to implement circellar queue is 5
• array
Whene queue is empty, FRONT and REAR point to indene in the
REAR represents insertion at the REAR index
FRONT represents deletion from the FRONT inden
Filling up the queue
enqueue ("a")
REAR = (REAR + 1) % 5; [ FRONT =0; REAR= 1]
enqueue ("b"); REAR = (REAR +17%.5; [FRONT = 0;
REAR= 1
(FRONTE O; REAR=4]
enqueue ("d"); REAR = (REAR +1) %5;
Now the queue size is H. hence overflow condition is reached.
Checking valves
When Queue is full o
when Sueue is empty
(REAR +1%
(4+1)%5=0
FRONT=0
REAR =0
n =
FRONT=0
o. Option A is correct

Suppose a circular queue of capacity (n-1) elements is implemented with an array of n elements. Assume that the insertion and de