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

  1. A.

    rear == front

  2. B.

    rear == size - 1

  3. C.

    front == -1

  4. D.

    (rear + 1) % size == front

Attempted by 311 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…