Queue in C++

Google Advertisements

Prev Tutorial Next Tutorial

Queue Data Structure in C++

Queue is work on the principal of First-In-First-Out (FIFO), it means first entered item remove first. Queue have two end front and rear, from front you can insert element and from rear you can delete element.

queue in c++

Real Life Example of Queue

A common example of queue is movie theater ticket counter, there first person who stand in front of ticket window take ticket first and remove from line and new person always stand in line from end.

real life example of queue in c++

Library Counter is another best Real Life Example of Queue; here first person visit first on counter for issue book and exit first.

Application of Queue Data Structure in C

Queues are used for any situation where you want to efficiently maintain a First-in-first out order on some entities. Transport and operations research where various entities are stored and held to be processed later i.e the queue performs the function of a buffer.

In a multitasking operating system, the CPU cannot run all jobs at once, so jobs must be batched up and then scheduled according to some policy. Again, a queue might be a suitable option in this case.

Operation on a Queue

The basic operation that can be perform on queue are;

  • Insert an element in a queue.
  • Delete an element from the queue.

Prev Tutorial Next Tutorial

Download Projects

Adsense Advertisements
Free Classified Site – Bedpage

Yahoo Ads Advertisements