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

Queues work on a First In First Out structure (FIFO). This means that the first piece of information, or first instruction input is the first to be done. This method is used for things such as keyboard and printer queues where having a Last In First Out structure would make no sense, especially with a keyboard where you want the key you press to happen first.

The keyboard buffer into which characters are stored as they are pressed operates as a queue. The first letter typed is the first letter sent. Subsequent letters are added at the tail of the buffer. || ||  Requests for printing are sent and the fist sent is the first printed. A printer queue stores the requests as they arrive. || || Check-outs and traffic lights are good examples of queues. The aim is to minimize the wait time on queues and to minimize the number of queues to keep the costs down. For more complex systems computer programs are written to simulate these queues and to predict the behavior of queues under certain conditions in order to maximize efficiency and cost. || || A website will often work on a FIFO basis. The first user to request the website will be the first person that the server sends back information to. || ||
 * ==Keyboard Queues==
 * == Printer Queues ==
 * ==Customer Queue Simulations==
 * ==Website Server==