In an array-based implementation of a circular queue, overflow occurs when
TPSC Computer/IT Posts · 2026 · Junior Forensic Digital Analyst · Part III
In an array-based implementation of a circular queue, overflow occurs when
- A.
rear == front
- B.
rear == size - 1
- C.
front == -1
- D.
(rear + 1) % size == front
Attempted by 311 students.
Sign up free to check your answer
Sign up freeLoading lesson…