Queue §

• First in, last out (FIFO), double linked list works well.
  • Think of a standard queue, for example at the bank.
  • The add and remove operations are called enqueue and dequeue.

Items are inserted at one end (rear) and deleted at the other end (the front).

We use ENQUEUE for insertion and DEQUEUE for deletion.

Applications §

• Applications with a single resource that you are trying to share
• Printer queues
• Email message queues
• Processor queues