Q35

MCQ2 marks, −0.67

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 $\textsf{REAR}$ and $\textsf{FRONT}$ as array index variables, respectively. Initially, $\textsf{REAR} = \textsf{FRONT} = 0$ . The conditions to detect queue full and queue empty are:

(A)

$\text{full}: (\textsf{REAR}+1) \mod n == \textsf{FRONT}$ $\text{empty}: \textsf{REAR} == \textsf{FRONT}$

(B)

$\text{full}: (\textsf{REAR}+1) \mod n == \textsf{FRONT}$ $\text{empty}: (\textsf{FRONT}+1) \mod n == \textsf{REAR}$

(C)

$\text{full}: \textsf{REAR} == \textsf{FRONT}$ $\text{empty}: (\textsf{REAR}+1) \mod n == \textsf{FRONT}$

(D)

$\text{full}: (\textsf{FRONT}+1) \mod n == \textsf{REAR}$ $\text{empty}: \textsf{REAR} == \textsf{FRONT}$

Loading…