Applications of queues ii

TYPES OF QUEUES

1. Linear Queues.

2. Circular Queues.

3. Priority Queues.

4. Deque.

Twitter: @THATlittleJOKE

• A priority queue is a queue in which
insertion or deletion of items from any PRIORITY
position in the queue are done based on QUEUE
some property (such as priority of task).
– The main objective is to serve first the
items with higher priority.

DEQUE


METHODS OF IMPLEMENTATION

METHOD 1 : METHOD 2 :

• A common method of
implementation of a priority
queue is to open as many queues
as there are priority factors.

• A low priority queue will be
operated for deletion only when
all its high priority predecessors
are empty.


IMPLEMENTATION
METHOD 1:
• ENQUEUEING

1. Each distinct priority will have a separate
queue to have its respective elements.

2. Thus when enqueing an item, we need
both the item and its priority to enqueue
it in the respective queue.

3. The items will be enqueued into the
respective queue based on their priority.


Cont.,
METHOD 1:

• DEQUEUEING

1.A dequeue command checks for items
in the queue with the highest priority.

2.Once it is found non-empty, the item
from it will be dequeued based on the
FIFO concept.

3.If the queue is empty, it moves to the
next non-empty queue in the order and
performs the operation.


Cont.,
METHOD 1:

• The “Queue Overflow” warning will be
thrown only when all the queues are
found full.

• The “Queue Underflow” warning will
be thrown only when all the queues
are found empty.

• The implementation depends upon the
application (TRADE OFF)


APPLICATIONS
METHOD 1:

1. O.S Job Scheduling.

2.Sharing a single runway of an
airport for both landing and take-off
of flights.


APPLICATION
O.S JOB SCHEDULING:

Q1-4 A B C D

Q2-2 X Y Z Q

Q3-1 M N O


APPLICATIONS

2.Sharing a single runway of an airport for
both landing and take-off of flights.



METHOD 1 : METHOD 2 :

• A common method of • Another method of
implementation of a priority implementation could be to sort
the elements in the queue
queue is to open as many queues according to the descending
as there are priority factors. order of priorities every time an
insertion takes place.
• A low priority queue will be
• The top priority element at the
operated for deletion only when head of the queue is the one to
all its high priority predecessors be deleted.
are empty.


IMPLEMENTATION
METHOD 2:

• Despite of having separate queues for
every distinct priority, here we use only
one queue.

• We store the items in the queue in the
descending order of priority, thus
making it possible with a single queue.


IMPLEMENTATION
METHOD 2:
• ENQUEUE:

• Here too, the priority of the item is also
needed to enqueue the item.

• The items are enqueued in the queue
based on their priorities.

• The items are enqueued at the right
place so that the queue retains its
descending order.


IMPLEMENTATION
METHOD 2:

• DEQUEUE:

• The dequeue operation is performed
the same method as done in the linear
queue.

• As it is the item with the highest
priority which is at the front end, it is
obviously the element with the highest
priority that is being pushed out.


IMPLEMENTATION
METHOD 2:

• The “Queue Overflow” warning will be
thrown when the queue is found full
(physically or procedurally).

• The “Queue Underflow” warning will
be thrown only when the queue is
empty.


APPLICATIONS
METHOD 2:

1. Sorting.

2.O.S Job sharing .


APPLICATION
SORTING:

{(A,4),(B,2),(C,5),(D,1),(E,3)}

A B E D
C


ADVANTAGES
 METHOD 1:
 Doesn’t incur any expensive operation (queue
movement).
 METHOD 2:
 Consumes lesser memory.

DISADVANTAGES
 METHOD 1:
 Consumes more memory.
 METHOD 2:
 Incurs any expensive operation (queue
movement).
 Eachqueue can be treated as a linear (linear or circular) queue
 Hence the usage depends on the application and its needs (TRADE OFF).


A priority queue is a queue in which
insertion or deletion of items from any PRIORITY
position in the queue are done based on QUEUE
some property (such as priority of task).
The main objective is to serve first the items with
higher priority.

A deque (Double Ended Queue) is a
linear list in which all insertions and
deletions are made at the end of the list. DEQUE


DEQUE
 A deque is therefore more general than a
queue and is a sort of FLIFLO (first in last in
or first out last out). Two way insertion or
deletion.

 Thus while one speaks of the top or
bottom of a stack, or front or rear of a
queue, one refers to the right end or left
end of a deque.

 A deque has two variants: input restricted
deque and output restricted deque.



TYPE 1 : INPUT RESTRICTED DEQUE TYPE 2 : OUTPUT RESTRICTED DEQUE

 An input restricted deque is one  An output restricted deque allows
where insertions are allowed at insertions at both ends of the
one end only while deletions are deque but permits deletions only
allowed at both ends. at one end.


DEQUE

IMPLEMENTATION


DEQUE

APPLICATION


Thank You…..

Queries..??


Applications of queues ii

More Related Content

What's hot (20)

Viewers also liked (20)

Similar to Applications of queues ii (20)

More from Tech_MX (20)

Recently uploaded (20)

Applications of queues ii