← Quiz: Stack and Queue in C: all 10 questions
Quiz: Stack and Queue in C · Question 9 of 10
What is the main problem with a plain (non-circular) array queue?
What is the main problem with a plain (non-circular) array queue?
- A.Dequeue is O(n)
- B.Slots freed by dequeue at the front are never reused, so it can report full while space is free
- C.It cannot store negative numbers
- D.It follows LIFO order
Answer & explanation
Correct answer: Slots freed by dequeue at the front are never reused, so it can report full while space is free
front and rear only move forward; the circular version wraps them with % MAX.
Can you get the rest right without peeking?
Take the timed Quiz: Stack and Queue in C quiz free. Pass it to earn XP and count towards your certificate.
Start the quiz →