Discussion :: GATE CSE
- 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
|
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 |
Whatsapp
Facebook
Answer : Option A
Explanation :
-NA-
Be The First To Comment