B.Manoj - 13MX27
M.Parthiban - 13MX32
R.Sathasivam - 13MX41
G.Sivanantham - 13MX45
N.TamilArasan – 13MX49
What is deque ?
A double-ended queue is an abstract data type
that generalizes a queue, for which elements can
be added to or removed from either the front or
It is also often called a head-tail linked list.
Deletion can be made from both ends , but
Insertion can be made at one end only.
Insertion can be made at both ends , but
Deletion can be made from one end only.
pushRear() - Insert element at back
pushFront() - Insert element at front
popRear() - Remove last element
popFront() - Remove first element
isEmpty() – Checks whether the queue
is empty or not.
Madam, Radar, Malayalam are some examples
A-Steal job scheduling algorithm
– The A-Steal algorithm implements task scheduling
for several processors(multiprocessor scheduling).
– The processor gets the first element from the deque.
– When one of the processor completes execution of
its own threads it can steal a thread from another
– It gets the last element from the deque of another
processor and executes it.
Undo - Redo operation in software applications