Stack and Queue

UNIT V : Stack and Queue
By
Mr.S.Selvaraj
Asst. Professor (SRG) / CSE
Kongu Engineering College
Perundurai, Erode, Tamilnadu, India
Thanks to and Resource from : Sumitabha Das, “Computer Fundamentals and C Programming”, 1st Edition, McGraw Hill, 2018.
20CST21 – Programming and Linear Data Structures

Syllabus – Unit Wise
7/15/2021 5.1 _ Introduction to Stack 2

List of Exercises

Text Book and Reference Book

Unit IV : Contents
1. Introduction to Stack
2. Implementation of stack using
– Array and linked list
3. Application of stack
– Infix to Postfix expression conversion
– Postfix expression evaluation
4. Introduction to Queue
5. Implementation of Queue using
6. Other variations of Queue
7. Applications of Queue
7/15/2021 5
5.1 _ Introduction to Stack

Introduction to Stack
• Stack is a simple data structure which has
bounded capacity.
• In stack, data is added and removed at only one
end called the Top.
• When an item is inserted on to the stack, it is
placed on Top of the stack.
• When an item is removed from the stack, it
removes the Top most element.
• There are two basic operations performed on a
Stack:
– Push()
– Pop()

Introduction to Stack
• In stack terminology,
– insertion operation is called Push() operation and
– removal operation is called Pop() operation.
• The last element that is pushed into the stack
is the first element to be popped out of the
stack.
• That is, it follows Last-In First-Out (LIFO)
strategy.
• Some of the features of stack are as follows:

Features of Stack
• Stack is an ordered list of similar type of
elements.
• It is a linear list where all insertions and deletions
are permitted only at one end of the list called
Top.
• Stack is a LIFO (Last-In-First-Out) structure.
• When a stack is full then it is said to be in
Overflow state
• When a stack is empty then it is said to be in
Underflow state.

Stack Data Structure

Stack - Push Operation

Pop Operation

Application of Stack in Real time scenario
• A stack of plates on the dining table
• Wearing and Removing of Bangles in our hand

Applications of stack in Computer Science and Programming
• Support of function calls
– When a function is invoked, the function which is invoked last will be
completed first. This is the property of stack.
– Primary purpose is to store the return address.
• Support of recursive functions
– When a function calls itself recursively, a return address needs to be stored
for each activation of the function so that it can later be used to return from
the function activation.
• An "undo/redo" mechanism in text editors
• Expression Evaluation
– Used to evaluate prefix, postfix and infix expressions.
• Expression Conversion
– An expression can be represented in prefix, postfix or infix form. Stack can be
used to convert one form of expression to another
• Reverse a string
– Push a given word to stack letter by letter and then pop letters from the stack
one by one
• Forward and backward feature in web browsers
• Parenthesis Checking
– Stack is used to check the proper opening and closing of parenthesis

Implementation of Stack
• Stack can be implemented using any one of
the following data structures:
– Array
– Linked List
• Implementing a stack using array can store
fixed number of data values but using linked
list hold any number of elements .

Stack using Array
• Stack can be implemented using one
dimensional array.
• Array can be created in predefined size.
• We can not increase the size of the array if we
have more elements to insert.
• That is, Stack implementation with array can
hold only fixed number of elements

Stack using Array
• we need an integer variable to keep track of
Top most element in the stack.
• It should be initialized with -1 to indicate stack
empty.

Stack using Array
• In the above definition, SIZE is a constant
which represents maximum number of
elements stored in a stack.
• Value of Top = SIZE – 1 indicates stack is full.
• In a stack, initially Top is set to -1.
• Top is used to keep track of the index of the
Top most element.

Stack using Array
• The following table represents status of stack
for different values of Top.

Push(value) - Inserting value into the stack
• Step 1: Check whether stack is already FULL.
Stack is Full when Top= SIZE-1.
• Step 2: If it is FULL then display "Stack is
FULL" and stop the function.
• Step 3: If it is not FULL, then increment Top
value by one and store the value at stk[Top].

Pop() - Remove a value from the Stack
• Step 1: Check whether stack is EMPTY. It is
Empty when Top= -1
• Step 2: If it is EMPTY, then display "Stack is
Empty" and stop the function.
• Step 3: If it is not EMPTY, then delete Top
most element (ie., stack[Top]) and decrement
Top value by one.
Top = Top -1

Display() - Display the elements of a Stack
• Step 1: Check whether stack is EMPTY.
• Step 2: If it is EMPTY, then display "Stack is Empty"
and terminate the function.
• Step 3: Initialize a variable 'i' with a value Top.
• Step 4: Display the value of stack[i] and decrement
the value of i by one
• Step 5: Repeat step 4 until “i” value becomes 0.

Stack using Array

Thank you

Unit IV : Contents
7/15/2021 30
5.2 _ Implementation of Stack

Implementation of Stack
• Stack can be implemented using any one of
the following data structures:
– Array
– Linked List
• Implementing a stack using array can store
fixed number of data values but using linked
list hold any number of elements .
7/15/2021 5.2 _ Implementation of Stack 31

Stack using Array
• Stack can be implemented using one
dimensional array.
• Array can be created in predefined size.
• We can not increase the size of the array if we
have more elements to insert.
• That is, Stack implementation with array can
hold only fixed number of elements

Stack using Array
• we need an integer variable to keep track of
Top most element in the stack.
• It should be initialized with -1 to indicate stack
empty.

Stack using Array
• In the above definition, SIZE is a constant
which represents maximum number of
elements stored in a stack.
• Value of Top = SIZE – 1 indicates stack is full.
• In a stack, initially Top is set to -1.
• Top is used to keep track of the index of the
Top most element.

Stack using Array
• The following table represents status of stack
for different values of Top.

Push(value) - Inserting value into the stack
• Step 1: Check whether stack is already FULL.
Stack is Full when Top= SIZE-1.
• Step 2: If it is FULL then display "Stack is
FULL" and stop the function.
• Step 3: If it is not FULL, then increment Top
value by one and store the value at stk[Top].

Pop() - Remove a value from the Stack
• Step 1: Check whether stack is EMPTY. It is
Empty when Top= -1
• Step 2: If it is EMPTY, then display "Stack is
Empty" and stop the function.
• Step 3: If it is not EMPTY, then delete Top
most element (ie., stack[Top]) and decrement
Top value by one.
Top = Top -1

Display() - Display the elements of a Stack
• Step 1: Check whether stack is EMPTY.
• Step 2: If it is EMPTY, then display "Stack is Empty"
and terminate the function.
• Step 3: Initialize a variable 'i' with a value Top.
• Step 4: Display the value of stack[i] and decrement
the value of i by one
• Step 5: Repeat step 4 until “i” value becomes 0.

Stack using Array

Array implementation of stack
• Pros: Easy to implement. Memory is not efficiently
utilized as pointers are not involved.
• Cons: It is not dynamic. It doesn’t grow and shrink
depending on needs at runtime
7/15/2021 45

Linked list Implementation of Stack
//Initially,
struct stack
{
int data;
struct stack *next;
}*head,*temp;
//Function Prototype
void push(void);
void pop(void);
void display(void);
int isempty(void);
7/15/2021 46

void push()
{
int x;
printf("n enter the numbern");
scanf("%d",&x);
temp=(struct stack *)malloc(sizeof(struct stack));
temp->data=x;
temp->next=NULL;
if(head==NULL)
{
head=temp;
}
else
{
temp->next=head;
head=temp;
}
}
7/15/2021 47

int isempty()
{
if(head==NULL)
return 1;
else
return 0;
}
void pop()
{
if(isempty())
printf("n stack is emptyn");
else
{
printf("n The popped element is %d",head->data);
head=head->next;
}
}
7/15/2021 48

void display()
{
if(isempty())
printf("n stack is emptyn");
else
{
temp=head;
while(temp!=NULL)
{
printf("%d->",temp->data);
temp=temp->next;
}
printf("NULL");
}
}
7/15/2021 49

int main()
{
int c;
while(1)
{
printf("n1.push 2.pop 3.display 4.exitn");
scanf("%d",&c);
switch(c)
{
case 1:
push();
break;
case 2:
pop();
break;
7/15/2021 50

case 3:
display();
break;
case 4:
exit(0);
}
}
return 0;
}
7/15/2021 51

Thank you

Unit IV : Contents
7/15/2021 54
5.3 _ Application of Stack

Applications of Stack
Balancing Parenthesis
Postfix Expressions Evaluation
Infix to Postfix Conversion
Towers of Hanoi problem
String Reversal
sudoku solver
7/15/2021 55

Infix, Prefix, Postfix Expression
• Infix expression:
– An expression is called the Infix expression if the operator
appears in between the operands in the expression.
– Simply of the form (operand1 operator operand2).
– Operators are written in-between their operands.
X + Y
A * ( B + C ) / D
• Prefix expression (also known as "Polish notation"):
– An expression is called the Prefix expression if the
operator appears before the operands in the expression.
– Simply of the form (operator operand1 operand2).
– Operators are written before their operands.
+ X Y
/ * A + B C D
7/15/2021 56

• Postfix expression (also known as "Reverse
Polish notation"):
– An expression is called the postfix expression if the
operator appears in the expression after the
operands.
– Simply of the form (operand1 operand2 operator).
– Operators are written after their operands.
X Y +
A B C + * D /
7/15/2021 57

7/15/2021 58

Infix to Postfix Conversion
Algorithm
1. Scan the infix expression from left to right.
2. If the scanned character is an operand, output it.
3. Else,
…..3.1 If the precedence of the scanned operator is greater than
the precedence of the operator in the stack or the stack is
empty or the stack contains a ‘(‘, push it.
…..3.2 Else, Pop all the operators from the stack which are
greater than or equal to in precedence than that of the
scanned operator. After doing that Push the scanned
operator to the stack. (If you encounter parenthesis while
popping then stop there and push the scanned operator in
the stack.)
4. If the scanned character is an ‘(‘, push it to the stack.
5. If the scanned character is an ‘)’, pop the stack and output all
the operators until a ‘(‘ is encountered, and discard both
the parenthesis.
6. Repeat steps 2-6 until infix expression is scanned.
7. Print the output
8. Pop and output from the stack until it is not empty.
7/15/2021 59

An illustration
• First, the symbol a is read, so it is passed through to the output. Then '+' is
read and pushed onto the stack.
• Next b is read and passed through to the output
• Next a '*' is read. The top entry on the operator stack has lower
precedence than '*', so nothing is output and '*' is put on the stack.
• Next, c is read and output.
7/15/2021 60

An illustration
• The next symbol is a '+'. Checking the stack, we find that we
will pop a '*' and place it on the output, pop the other '+',
which is not of lower but equal priority, on the stack, and then
push the '+'.
• The next symbol read is an '(', which, being of highest
precedence, is placed on the stack. Then d is read and output.
7/15/2021 61

An illustration
• We continue by reading a '*'. Since open parentheses do not
get removed except when a closed parenthesis is being
processed, there is no output. Next, e is read and output.
• The next symbol read is a '+'. We pop and output '*' and then
push '+'. Then we read and output
7/15/2021 62

An illustration
• Now we read a ')', so the stack is emptied back to the '('. We
output a '+'.
• We read a '*' next; it is pushed onto the stack. Then g is read
and output.
7/15/2021 63

An illustration
• The input is now empty, so we pop and output symbols from
the stack until it is empty.
7/15/2021 64

7/15/2021 65

7/15/2021 66

7/15/2021 67

PROBLEM
1. 3+4*5/6
2. (300+23)*(43-21)/(84+7)
3. (4+8)*(6-5)/((3-2)*(2+2))
7/15/2021 68

ANSWER
1. 3 4 5 * 6 / +
2. 300 23 + 43 21 -* 84 7 + /
3. 4 8 + 6 5 -* 3 2 –2 2 + * /
7/15/2021 69

Problems
1) Infix : (A+B) * (C-D)
Infix to Postfix : AB+CD-*
2) Infix : A-(B/C)*(A/K)-L
Infix to Postfix : ABC/-AK/L-*
7/15/2021 70

Expression Evaluation
The simple algorithm uses a stack and is as follows:
1. Make an empty stack.
2. Read an input string.
3. Read characters one by one until end of string is
encountered.
4. If the character is a digit, convert it into an integer
and push onto the stack.
5. If the character is not a digit, pop two numbers from
the stack and perform the corresponding operation
and push the result onto the stack.
6. At end of the string, pop the result from the stack
7/15/2021 71

ILLUSTRATION
7/15/2021
Next '+' is read, so 3 and 2 are popped from the stack and their sum, 5, is pushed.
Next 8 is pushed.
72

7/15/2021
Now '*' is read, so 8 and 5 are popped as 8 * 5 = 40 is pushed.
73

7/15/2021 74

PROBLEM
1. 3+4*5/6
2. (300+23)*(43-21)/(84+7)
3. (4+8)*(6-5)/((3-2)*(2+2))
7/15/2021 75

Thank you
7/15/2021 5.3 _ Application of Stack 76

Unit IV : Contents
7/15/2021 78
5.4 _ Introduction to Queue and its
Implementation

Introduction to Queue
7/15/2021
Implementation
79
Front
Rear

Introduction to Queue
• Queue is a simple linear data structure which is a
ordered list of similar type of items.
• In Queue, data is added at one end called the rear, and
data is removed at the other end called the front.
• Queue follows FIFO (First-In-First-Out) strategy i.e. The
element which is inserted first is the one removed first.
7/15/2021 80
Implementation

Queue Representation
7/15/2021
Implementation
81

Queue ADT
• The following operations are implemented in queue
data structure:
– Isfull() – used to check whether the queue is full.
– Isempty() – used to check whether the queue is empty.
– Enqueue() – used to add a new item to the end of the
queue. (Insertion Operation)
– Dequeue()- used to remove the front item from the queue.
(Deletion Operation)
– Display() - used to display all the elements in the queue.
7/15/2021 82
Implementation

Applications of Queue
• CPU scheduling
– When multiple processes require CPU at the same time,
CPU scheduling algorithms schedules the tasks for
submission. Usually these algorithms are implemented
using Queue data structure.
• Printer Queue
– Jobs submitted to a printer are printed in order of their
arrival.
• Call Center phone systems
– All the calls are queued until a service representative is
free. Calls are serviced based on the order of their arrival.
7/15/2021 83
Implementation

Implementation Of Queue
• There are two ways to implement a queue:
–Sequential allocation Using array
–Linked allocation Using linked list
7/15/2021 84
Implementation

Linear Queue – Definition and Overflow
7/15/2021
Implementation
85

Linear Queue – Underflow
7/15/2021
Implementation
86

Linear Queue – Enqueue
7/15/2021
Implementation
87

Linear Queue – Dequeue
7/15/2021
Implementation
88

Linear Queue – Traversal / Display
7/15/2021
Implementation
89

Array implementation of Queue
Initially,
#define MAX 3
int q[MAX], rear=-1, front=-1;
Function Prototype
void enqueue(void);
void dequeue(void);
int isfull(void);
int isempty(void);
void display(void);
7/15/2021 90
Implementation

int isfull()
{
if(rear==MAX-1)
return 1;
else
return 0;
}
int isempty()
{
if(front==-1||front>rear)
return 1;
else
return 0;
}
7/15/2021 91
Implementation

void enqueue()
{
int x;
if(isfull())
printf("n queue is fulln");
else
{
scanf("%d",&x);
if(rear==-1)
{
front=0;
q[++rear]=x;
}
else
{
q[++rear]=x;
}
}
}
7/15/2021 92
Implementation

void dequeue()
{
if(isempty())
printf("n queue is emptyn");
else if(front==rear)
{
printf("n The dequeued element is %dn",q[front]);
front=rear=-1;
}
else
{
printf("n The dequeued element is %dn",q[front]);
front++;
}
}
7/15/2021 93
Implementation

void display()
{
int i;
if(isempty())
else
{
printf("n the elements in the queue aret");
for(i=front;i<=rear; i++)
printf("%dt",q[i]);
}
}
7/15/2021 94
Implementation

int main()
{
int c;
while(1)
{
printf("n1.enqueue 2.dequeue 3.display 4.exitn");
scanf("%d",&c);
switch(c)
{
case 1:
enqueue();
break;
case 2:
dequeue();
break;
case 3:
display();
break;
case 4:
exit(0);
}
}
return 0;
}
7/15/2021 95
Implementation

Linked List implementation of Queue – Define and underflow
7/15/2021
Implementation
96

Linked List implementation of Queue - Display
7/15/2021
Implementation
97

Linked List implementation of Queue - Enqueue
7/15/2021
Implementation
98

Linked List implementation of Queue - Enqueue
7/15/2021
Implementation
99

Linked List implementation of Queue - Dequeue
7/15/2021
Implementation
100

Linked List implementation of Queue
struct queue
{
int data;
struct queue *next;
}*rear, *front,*temp;
Function Prototype
void enqueue(void);
void dequeue(void);
void display(void);
int isempty(void);
7/15/2021 101
Implementation

void enqueue()
{
int x;
scanf("%d",&x);
temp=(struct queue *)malloc(sizeof(struct queue));
temp->data=x;
temp->next=NULL;
if(front==NULL)
{
front=rear=temp;
}
else
{
rear->next=temp;
rear=temp;
}
}
7/15/2021 102
Implementation

int isempty()
{
if(front==NULL)
return 1;
else
return 0;
}
void dequeue()
{
if(isempty())
else
{
printf("n The deleted element is %d",front->data);
front=front->next;
}
}
7/15/2021 103
Implementation

void display()
{
if(isempty())
else
{
temp=front;
while(temp!=NULL)
{
printf("%d->",temp->data);
temp=temp->next;
}
printf("NULL");
}
}
7/15/2021 104
Implementation

int main()
{
int c;
while(1)
{
printf("n1.enqueue 2.dequeue 3.display 4.exitn");
scanf("%d",&c);
switch(c)
{
case 1:
enqueue();
break;
case 2:
dequeue();
break;
7/15/2021 105
Implementation

case 3:
display();
break;
case 4:
exit(0);
}
}
return 0;
}
7/15/2021 106
Implementation

Thank you
7/15/2021
Implementation
107

Unit IV : Contents
7/15/2021 109
5.5 _ Types of Queue and its Applications

Types of Queue
• Linear Queue
• Circular Queue
• Double Ended Queue
• Priority Queue
7/15/2021 5.5 _ Types of Queue and its Applications 110

Types of Queue

Linear Queue

Linear Queue
• In Linear Queue, an
– insertion takes place from one end
– deletion occurs from another end
• The end at which the
– insertion takes place is known as the rear end,
– deletion takes place is known as front end
• It strictly follows the FIFO rule.

Linear Queue
• The linear Queue can be represented, as shown
in the below figure:
• The elements are inserted from the rear end, and
if we insert more elements in a Queue, then the
rear value gets incremented on every insertion.

Linear Queue
• If we want to show the deletion, then it can be
represented as:
• The front pointer points to the next element, and the
element which was previously pointed by the front
pointer was deleted.

Drawbacks of Linear Queue
• The major drawback of using a linear Queue is
that insertion is done only from the rear end.
• If the first three elements are deleted from the
Queue, we cannot insert more elements even
though the space is available in a Linear Queue.
• In this case, the linear Queue shows
the overflow condition as the rear is pointing to
the last element of the Queue.
• Solution is Circular Queue.

Circular Queue

Why was the concept of the circular queue introduced?
• There was one limitation in the array
implementation of Queue.
• If the rear reaches to the end position of the
Queue then there might be possibility that
some vacant spaces are left in the beginning
which cannot be utilized.
• So, to overcome such limitations, the concept
of the circular queue was introduced.

• As we can see in the previous image, the rear is at the last position
of the Queue and front is pointing somewhere rather than the
0th position.
• In the above array, there are only two elements and other three
positions are empty.
• if we try to insert the element then it will show that there are no
empty spaces in the Queue.
• There is one solution to avoid such wastage of memory space by
shifting both the elements at the left and adjust the front and rear
end accordingly.
• It is not a practically good approach because shifting all the
elements will consume lots of time.
• The efficient approach to avoid the wastage of the memory is to
use the circular queue data structure

Circular Queue
• It is linear data structure.
• operations are performed based on FIFO (First In First Out)
principle
• last position is connected back to the first position to make a
circle.
• It is also called ‘Ring Buffer’.
7/15/2021 121

Circular Queue
• In a normal Queue, we can insert elements until queue becomes
full. But once queue becomes full, we can not insert the next
element even if there is a space in front of queue.
• In circular queue, we can insert the next element even rear is
reached last position.

Operations of Circular Queue
• The following are the operations that can be
performed on a circular queue:
– Front: It is used to get the front element from the
Queue.
– Rear: It is used to get the rear element from the
Queue.
– enQueue(value): This function is used to insert the
new value in the Queue. The new element is always
inserted from the rear end.
– deQueue(): This function deletes an element from the
Queue. The deletion in a Queue always takes place
from the front end.

Steps on Enqueue Operation
• First, we will check whether the Queue is full
or not.
• Initially the front and rear are set to -1.
• When we insert the first element in a Queue,
front and rear both are set to 0.
• When we insert a new element, the rear gets
incremented, i.e., rear=rear+1.

Steps on Enqueue Operation (contd.,)

Steps on Dequeue Operation
• First, we check whether the Queue is empty or
not.
• If the queue is empty, we cannot perform the
dequeue operation.
• When the element is deleted, the value of front
gets decremented by 1.
• If there is only one element left which is to be
deleted, then the front and rear are reset to -1.

Circular Queue - Applications
• Memory Management: The unused memory locations in the case
of ordinary queues can be utilized in circular queues.
• Traffic system: In a computer-controlled traffic system, circular
queues are used to switch on the traffic lights one by one
repeatedly as per the time set.
• CPU Scheduling: Operating systems often maintain a queue of
processes that are ready to execute or that are waiting for a
particular event to occur (Round-robin scheduling).
7/15/2021 127

Double Ended Queue (Deque)

 The deque stands for Double Ended Queue.
 In the queue, the insertion takes place from one end while
the deletion takes place from another end.
 The end at which the
 insertion occurs is known as the rear end
 deletion occurs is known as front end.
 linear data structure
7/15/2021 129

Properties of Deque
• Deque can be used both as stack and queue as it allows the
insertion and deletion operations on both ends.
• (1) In deque, the insertion and deletion operation can be
performed from one side.
• The stack follows the LIFO rule in which both the insertion
and deletion can be performed only from one end;
• Therefore, we conclude that deque can be considered as a
stack.

Properties of Deque
• (2) In deque, the insertion can be performed on one
end, and the deletion can be done on another end.
• The queue follows the FIFO rule in which the element
is inserted on one end and deleted from another end.
• Therefore, we conclude that the deque can also be
considered as the queue.

Types of Deque
• There are two types of Queues:
– Input-restricted queue
– output-restricted queue

Input restricted queue
• The input-restricted queue means that some
restrictions are applied to the insertion.
• In input-restricted queue,
– the insertion is applied to one end
– the deletion is applied from both the ends.
• This kind of Queue does not follow FIFO(first in first
out).
• Uses: This queue is used in the cases where the
consumption of the data needs to be in FIFO order
but and if there is a need to remove the recently
inserted data for some reasons and one such case
can be irrelevant data, performance issue, etc.
7/15/2021 133

Output restricted queue
• The output-restricted queue means that some
restrictions are applied to the deletion operation.
• In an output-restricted queue,
– the deletion can be applied only from one end
– the insertion is possible from both ends
• Uses: This queue is used in the case where the inputs
have some priority order to be executed and the
input can be placed even in the first place so that it is
executed first.
7/15/2021 134

List of Operations performed on Deque

• A deque can be implemented either using a doubly-linked
list or circular array.
• In both implementation, we can implement all operations in O(1)
time.

Applications of Deque
• The deque can be used as a stack and queue; therefore, it
can perform both redo and undo operations in software
applications.
• It can be used as a palindrome checker means that if we
read the string from both ends, then the string would be
the same.
• It can be used for multiprocessor scheduling. Suppose we
have two processors, and each processor has one process
to execute. Each processor is assigned with a process or a
job, and each process contains multiple threads. Each
processor maintains a deque that contains threads that are
ready to execute.
• Internet browser’s history

Priority Queue
• A priority queue is an abstract data type that behaves similarly to
the normal queue except that each element has some priority.
• The element with the highest priority would come first in a
priority queue.
• The priority of the elements in a priority queue will determine the
order in which elements are removed from the priority queue.
• The priority queue supports only comparable elements, which
means that the elements are either arranged in an ascending or
descending order.
• For example, suppose we have some values like 1, 3, 4, 8, 14, 22
inserted in a priority queue with an ordering imposed on the
values is from least to the greatest.
• Therefore, the
– 1 number would be having the highest priority
– 22 will be having the lowest priority

Characteristics of a Priority queue
• Every element in a priority queue has some
priority associated with it.
• An element with the higher priority will be
deleted before the deletion of the lesser
priority.
• If two elements in a priority queue have the
same priority, they will be arranged using the
FIFO principle.

Priority Queue Example
• We have a priority queue that contains the following values:
1, 3, 4, 8, 14, 22
• All the values are arranged in ascending order.
• Now, we will observe how the priority queue will look after
performing the following operations:
• poll(): This function will remove the highest priority element from
the priority queue. In the above priority queue, the '1' element has
the highest priority, so it will be removed from the priority queue.
• add(2): This function will insert '2' element in a priority queue. As 2
is the smallest element among all the numbers so it will obtain the
highest priority.
• poll(): It will remove '2' element from the priority queue as it has
the highest priority queue.
• add(5): It will insert 5 element after 4 as 5 is larger than 4 and
lesser than 8, so it will obtain the third highest priority in a priority
queue.

Types of Priority Queue
• There are two types of priority queue:
– Ascending order priority queue
– Descending order priority queue

Ascending order priority queue
• In ascending order priority queue, a lower priority
number is given as a higher priority in a priority.
• For example, we take the numbers from 1 to 5
arranged in an ascending order like 1,2,3,4,5;
• Therefore, the smallest number, i.e., 1 is given as the
highest priority in a priority queue.

Descending order priority queue
• In descending order priority queue, a higher priority
number is given as a higher priority in a priority.
• For example, we take the numbers from 1 to 5
arranged in descending order like 5, 4, 3, 2, 1;
• Therefore, the largest number, i.e., 5 is given as the
highest priority in a priority queue.

Implementation of Priority Queue
• The priority queue can be implemented in
four ways that include
– arrays
– linked list
– heap data structure and
– binary search tree
• The heap data structure is the most efficient
way of implementing the priority queue.

Priority Queue Operations
• The common operations that we can perform
on a priority queue are
– Insertion
– deletion and
– peek

Complexities using different
implementations of Priority Queue

What is Heap?
• A heap is a tree-based data structure that forms a
complete binary tree, and satisfies the heap property.
• If A is a parent node of B, then A is ordered with
respect to the node B for all nodes A and B in a heap.
• It means that the value of the parent node could be
more than or equal to the value of the child node
or
• the value of the parent node could be less than or
equal to the value of the child node.
• Therefore, we can say that there are two types of
heap.
– Max Heap
– Min Heap

Max heap
• The max heap is a heap in which the value of
the parent node is greater than the value of
the child nodes.

Min heap
• The min heap is a heap in which the value of
the parent node is less than the value of the
child nodes.

Applications of Priority Queue
• CPU Scheduling
• It is used in the Dijkstra's shortest path algorithm.
• It is used in prim's algorithm
• It is used in data compression techniques like Huffman
code.
• It is used in heap sort.
• It is also used in operating system like
– priority scheduling,
– load balancing and
– interrupt handling.

Applications of Queue
• Queue is used when things don’t have to be processed
immediately, but have to be processed in First In First Out order
like Breadth First Search.
• 1) When a resource is shared among multiple consumers. Examples
include CPU scheduling, Disk Scheduling.
2) When data is transferred asynchronously (data not necessarily
received at same rate as sent) between two processes. Examples
include IO Buffers, pipes, file IO, etc.
3) In Operating systems:
a) Semaphores
b) FCFS ( first come first serve) scheduling, example: FIFO queue
c) Spooling in printers
d) Buffer for devices like keyboard
4) In Networks:
a) Queues in routers/ switches
b) Mail Queues
5) Variations: (Deque, Priority Queue, Doubly Ended Priority
Queue )

Thank you

Stack and Queue

More Related Content

What's hot

Similar to Stack and Queue

More from Selvaraj Seerangan

Recently uploaded

Stack and Queue