
Linear Data Structure 491
14.17 REPRESENTATION OF QUEUE
The queue can be put into operation in two ways,
a) Static implementation : Static implementation means array implementation. In this
implementation, we should be assured of the number of elements we want in the queue. The
size of the array is decided before execution at compile time. Once the array is declared, its size
cannot be altered. The array at run time neither enlarged nor shrunk. The beginning of the
array, that is, Oth element is the front and the last memory location will be rear of the queue. A
queue can be declared as an array of any data type.
int queue[7];
In