In a queue implementation that uses an array of fixed size,
A) the array must be made so large that the queue will never run out of space
B) it is necessary to use the array as a circular buffer
C) the array must be created from an ArrayList object
D) the queue must implement the List interface

Question

Quizplus · Accepted Answer

In a queue implementation using an array of fixed size, it is necessary to use the array as a circular buffer to avoid wasting space and to efficiently manage the enqueue and dequeue operations. By using a circular buffer, we can overwrite elements that have already been dequeued and reuse the space. This makes the implementation much more efficient than if we were using a regular array where we would need to shift all the elements every time an element is dequeued.

In a Queue Implementation That Uses an Array of Fixed