| |
A queue is a linear data structure that simulates waiting in line. A queue has two ends, a front and a (rear) end.
Data must always enter the queue at the end and leave from the front of the line. This type of action can be summarized as FIFO (first-in, first-out).
A queue is the appropriate data structure when simulating waiting in line. A printer that is part of a multi-user network usually processes print commands on a FIFO basis. A queue would be used to maintain the order of the print jobs.
|