Sail E0 Webinar
Question
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
Options:
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
Answer: Option A


-NA-



Was this answer helpful ?
Next Question

Submit Solution

Your email address will not be published. Required fields are marked *

More Questions on This Topic :


Latest Videos

Latest Test Papers