The information in this list is processed in the same order as it was received, that is first in first out order (FIFO) or a first – come first – served (FCFS) basis.

This type of frequently used list is known as queue. We have two pointers to access the queue. They are

1.      Front (used for deletion)

2.      Rear (Used for insertion)

Insertion :

if rear>n queue overflow

else

increment the rear pointer and insert the value in the rear position.

Deletion :

If front =0 then queue underflow

Else

Increment the front pointer and return the front-1 value