A circular array implementation of a queue is more efficient than a fixed array implementation of a queue because elements never have to be ___________.
A) added
B) removed
C) shifted
D) initialized

Question

Quizplus · Accepted Answer

In a circular array implementation of a queue, when an element is removed from the front, there is no need to shift all other elements to fill the space. Instead, the head pointer is simply moved to the next element, making it more efficient than a fixed array where elements would need to be shifted to maintain the queue structure.

A Circular Array Implementation of a Queue Is More Efficient