Skip to main content
Lesson 39 - Queues
Lesson MenuPreviousNext
  
Queues page 3 of 8

  1. A queue is a linear data structure that simulates waiting in line. A queue has two ends, a front and a (rear) end.

  2. 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).

  3. 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.


Lesson MenuPreviousNext
Contact
 ©ICT 2003, All Rights Reserved.