Question

A queue has definite characteristics as listed below-

Head-the next item to exit queue is always the head.

Tail-the next item to enter queue will always enter at the tail.

Length of the queue-the number of items in queue (between head and tail).

Capacity of the queue-the maximum number of items that queue can hold.

Position of each item-a queue can have any number of items between the head and tail, but each item has a position within the overall order.

A queue can be implemented using a homogeneous array and a tail counter. The head of array is always the first element of the array. Every time an item exits the queue, the other items are stimulated up. New items are always added to the end of the array. The capacity of queue is equal to the capacity of the array. The tail counter specifies location of the tail in the array.

Analyze queue implementation previously specified for purposes of effectiveness. Identify the conditions under that implementation tends to deteriorate in efficiency. Recommend an improved implementation.