Which statement is true about condition of overflow in the circular Queue?
Which statement is true about condition of overflow in the circular Queue?
I. Front = 1 and Rear = N
II. Front = Rear + 1
Show answerHide answer
Correct answer: (C) Both I and II
Explanation
In a 1-based circular queue of size N, it is full (overflow) when Front = 1 and Rear = N, or when Front = Rear + 1 (rear has wrapped round to just behind front).