In an array-based implementation of a queue, what purpose is served by treating the array as circular? Is it required in order to have an array-based implementation of a queue?

What will be an ideal response?

Treating an array as a circular data structure allows re-use of the array elements that have been emptied by
dequeue operations. It provides more efficient use of memory.
An array-based implementation of a queue that is not circular is possible. The code to implement the enqueue and dequeue
operations can be simpler than in a circular implementation, but memory use is less efficient because it is not re-used.