What is queue in data structure and what are the application of queue explain?

What is queue in data structure and what are the application of queue explain?What is queue in data structure and what are the application of queue explain?
A queue is just a FIFO buffer. Queues are used for many things, often is OS data structures, comms and simulations.What is queue in data structure and what are the application of queue explain?
A queue is a particular kind of collection in which the entities in the collection are kept in order and the principal operations on the collection are the addition of entities to the rear terminal position and removal of entities from the front terminal position. This makes the queue a First-In-First-Out (FIFO) data structure. In a FIFO data structure, the first element added to the queue will be the first one to be removed.



Some Applications:

1) Serving requests of a single shared resource (printer, disk, CPU), transferring data asynchronously (data not necessarily received at same rate as sent) between two processes (IO buffers), e.g., pipes, file IO, sockets.

2) Call center phone systems will use a queue to hold people in line until a service representative is free.

3) Buffers on MP3 players and portable CD players, iPod playlist. Playlist for jukebox - add songs to the end, play from the front of the list.

4) When programming a real-time system that can be interrupted (e.g., by a mouse click or wireless connection), it is necessary to attend to the interrupts immediately, before proceeding with the current activity. If the interrupts should be handles in the same order they arrive, then a FIFO queue is the appropriate data structure.What is queue in data structure and what are the application of queue explain?
this link can solve ur problum about Q

http://www.authorstream.com/Presentation/ankush85-188652-queue-data-structures-structure-ds-education-ppt-powerpoint/