DataStructureDeQueue

Question

Suppose a dequeue is stored in a circular array with N memory cells. At which of the following condition is the dequeue is full? 

(i) LEFT = N and RIGHT = 1 
(ii) LEFT = RIGHT + 1 
(iii) LEFT = 1 and RIGHT = N 
(iv) LEFT = RIGHT - 1 + N

• A. (i) and (iii)
• B. (iii) and (iv)
• C. (ii) and (iii)
• D. (i) and (iv)

Comments

left means, front pointer position and right means rear pointer position

---

then why front=1?

It means front always contain 1 element in the circular array?

---

no, it means at particular time, front = 1 and rear=N, indicates queue is full !