Queue is a linear data structure where elements are inserted at the rear end and removed from the front end, making it a First In First Out (FIFO) structure. Elements are added to the back of the queue and the earliest elements exit from the front, similarly to waiting in line. Queues are useful for serving single shared resources like printers, scheduling CPU tasks, handling calls in call centers, and processing interrupts in real-time systems in the order they arrive.

1. Queue

4.  Queue is a linear data structure, just like stack data
structure, in which the first element is inserted from
one end called the REAR(also called tail), and the
removal of existing element takes place from the other
end called as FRONT(also called head).
 This makes queue as FIFO(First in First Out) data
structure, which means that element inserted first will
be removed first.

26. • Serving requests on a single shared resource,
like a printer, CPU task scheduling etc.
• In real life scenario, Call Centre phone
systems uses Queues to hold people calling
them in an order, until a service
representative is free.
• Handling of interrupts in real-time systems.
The interrupts are handled in the same order
as they arrive i.e First come first served.