When a queue is implemented using an array, the array has a fixed size. If more elements are added than the array can hold, an overflow condition occurs. This is a fundamental limitation of array-based queue implementations. Other options are incorrect - arrays do allow efficient access, don't allow middle removal without shifting, and store data contiguously.