COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
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 == FRONT, empty:REAR == FRONT
|
|
|
Full:(REAR+1) mod n == FRONT, empty:(FRONT+1) mod n == REAR
|
|
|
Full:REAR == FRONT, empty:(REAR+1) mod n == FRONT
|
|
|
Full:(FRONT+1) mod n == REAR, empty:REAR == FRONT
|
Explanation:
There is 1 question to complete.