1. Advanced Data Structure using C++

LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110)
DEFINATION OF PRIORITY QUEUES:-
A priority queues is a collection of element such that each element has been assigned a priority
and such that order in which element are deleted and processed from the following rules:
(a) An element of higher priority is processed before any element of lower
priority
(b) Two element with the same priority are processed according to
standard queues
Page-5
Example of priority queue is time sharing system, where programs of higher priority are
processed first.
There can be different criteria of determining the priority. Some of them are summarized
below:
1. A shortest job is given higher priority over the longer one.
2. An important job is given the higher priority over a routine type job. For example, a
transaction for on line booking of an order is given preference over payroll
processing.
3. In a commercial computer center, the amount you pay for job can determine priority
for your job. Pay more to get higher priority for your job.
Prepared By :­
Er. Harvinder Singh
Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 149 ‐