Implementation of queue ADT by using array

Question

Write down the prerequisites for implementing the queue ADT by using array?

Answer 1

For each queue data structure the given prerequisites should be satisfied:

a) Keep an array queue[ ].

b) The positions rear and front represents the ends of queue.

c) The number of elements which are in fact in the queue is kept track of using ‘size’.