Is it possible to re-use memory in an array-based implementation of a queue without treating the underlying array as circular?

What will be an ideal response?

Yes. If the front of the queue is at subscript 0, and if all array elements are shifted forward when a dequeue
operation occurs, then memory can be re-used. The tradeoff is that the dequeue operation becomes O(n) due to the shifting
of elements.