Discuss utility of circular queue in computer science?
Answers
Answered by
0
Answer: A circular queue reuses the empty slots at the front of the array that are caused when elements are removed from the queue. As items are enqueued, and the rear index pointer reaches the last position of the array, it wraps around to point to the start of the array (so long as the array is not full).
Explanation: Hope I helped! :) Plz click brainliest :P
Similar questions