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
- (i) and (iii)
- (iii) and (iv)
- (ii) and (iii)
- (i) and (iv)