1. Advanced Data Structure using C++

LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110)
QUEUES
Queues, like stacks, also used in the computer solution of many problems.
Perhaps the most common occurrence of a queue in computer applications is
for the scheduling jobs in batch processing.
When we talk of queues we talk about two distinct ends; the front and rear.
Additions to the queue take place at the rear. Deletions are made from the front.
So, if a job is submitted for execution, it joins at the rear of the job queue. The job
at the front of the queue is the next one to be executed(deleted).
First In First Out(FIFO) or First Come First Serve(FCFS) is the logical operation of the
queue.
Simple queue with the capacity n
DEFINATION OF QUEUES
QUEUES:‐
A queues is a logically “FIRST IN FIRST OUT”(FIFO) type of data
structure.It is a linear list in which deletion are performed from the
beinging i.e. front list and insertion are performed at the end is known
as rear of the list. The information in such type of list can be processed
Prepared By :­
Er. Harvinder Singh
Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 138 ‐