5.1.8+Describe+the+characteristics+and+applications+of+a+queue

=__**5.1.8 Describe the characteristics and applications of a queue.**__=

> > > > >
 * __ Queue (linear): __**
 * First-In-First-Out (FIFO) data structure
 * first element added to the queue is the first one to be removed
 * addition of entities to the rear terminal position = enqueue
 * removal of entities from the front terminal position = dequeue
 * called linear

> > > > >
 * __ Circular Queue: __**
 * First-In-First-Out (FIFO) data structure
 * first element added to the queue is the first one to be removed
 * addition of entities to the rear terminal position = enqueue
 * removal of entities from the front terminal position = dequeue
 * called linear



Example of a circular queue. Source: []

A conveyor-belt is used, where plates are washed by inserting them in one end, and they come out the other end, in the same order. That's a First-In-First-Out (FIFO).
 * __ Example: __**

Used when coding to create a print queue: the first variable that should be printed in inserted and will be the first one to be printed. Source: "Stack and Queue, Why?" Data Structures. N.p., n.d. Web. 18 Nov. 2014.

Created By: Max Kossatz Last update: 18/11/2014

Sources: > > >
 * "Programming Concepts: Queues." - Wikibooks, Open Books for an Open World. N.p., n.d. Web. 18 Nov. 2014.
 * "Queue (abstract Data Type)." Wikipedia. Wikimedia Foundation, 16 Nov. 2014. Web. 18 Nov. 2014.
 * "Stack and Queue, Why?" Data Structures. N.p., n.d. Web. 18 Nov. 2014.