Queue and Its Operations
“A queue is an ordered list in which all insertions are done from one end called REAR and deletions are made at another end called FRONT.” Queues are sometimes referred to as First In First Out (FIFO) lists.
Example:
- (a) The people waiting in line at a bank cash counter form a queue.
- (b) In computer, the jobs waiting in line to use the processor for execution. This queue is called Job Queue.
There are two basic queue operations.
- Enqueue: Enqueue: Inserts an item/element at the rear end of the queue. An error occurs if the queue is full.
- Dequeue: Removes an item/element from the front end of the queue and returns it to the user. An error occurs if the queue is empty.
Application of queue
Queues remember things in first-in-first-out (FIFO) order. Good for fair (first come first served) ordering of actions.
- (a) Scheduling processing of GUI events printing request.
- (b) Simulation orders the events models real life queues (e.g. supermarkets checkout, phone calls on hold).
Dear Aspirants,
Your preparation for GATE, ESE, PSUs, and AE/JE is now smarter than ever — thanks to the MADE EASY YouTube channel.
This is not just a channel, but a complete strategy for success, where you get toppers strategies, PYQ–GTQ discussions, current affairs updates, and important job-related information, all delivered by the country’s best teachers and industry experts.
If you also want to stay one step ahead in the race to success, subscribe to MADE EASY on YouTube and stay connected with us on social media.
MADE EASY — where preparation happens with confidence.
MADE EASY is a well-organized institute, complete in all aspects, and provides quality guidance for both written and personality tests. MADE EASY has produced top-ranked students in ESE, GATE, and various public sector exams. The publishing team regularly writes exam-related blogs based on conversations with the faculty, helping students prepare effectively for their exams.
