Subject: Data Structure

Week 6 Lecture

Stack and Its Applications

What, Why and How?

by

Dr Vinay Pathak
Stack Data Structure
It is called as stack because it behaves like a real-world stack, piles of
books, etc. It is a linear data structure.
Understanding the Stack
• Stack is an abstract data type with a pre-defined

capacity.

• One side open another side closed

• Works on LIFO (Last in First Out) or FILO (First

in Last Out) order to Insert or Delete the element.

• Top is a variable which contains the position of the

top-most element in the stack.

• Stack can be defined as a container in which insertion

(push) and deletion (pop) can be done from the one

end known as the top of the stack.

Stack Creation: Using Array

int stack[n], n = 100, top = -1;

Operations on Stack
push() − (Insertion) Insert element on the stack.

pop() − (Deletion) Removing an element from the stack.

Stack Overflow
push() − (Insertion) Insert element on the stack.

Push Operation Algorithm:

Step-1: If TOP = Max-1
Print “Overflow”
Overflow error
Goto Step 4
Step-2: Set TOP= TOP + 1
Step-3: Set Stack[TOP]= ELEMENT
Step-4: END
Stack Overflow
push() − (Insertion) Insert element on the stack.
int stack[n], n = 100, val=10, top = -1;
void push(int val, int n)
Push Operation Algorithm:
{
Step-1: If TOP = Max-1
if(top >= n-1)
Print “Overflow”
cout<<"Stack Overflow"<<endl;
Goto Step 4
else {
Step-2: Set TOP= TOP + 1
top++;
Step-3: Set Stack[TOP]= ELEMENT
stack[top] = val;
Step-4: END
}
Stack Underflow
pop() − (Deletion) Removing an element from the stack.

Pop Operation Algorithm:

Step-1: If top = -1 or top= NULL
Print “Underflow”
Underflow error Goto Step 3
Step-2: Set Val= Stack[TOP]
Step-3: Set top= top – 1
Step-4: End
Stack Underflow
pop() − (Deletion) Removing an element from the stack.

int stack[n], n = 100, val=10, top = -1;

Pop Operation Algorithm: void pop()

{
Step-1: If top = -1 or top= NULL
if(top <= -1)
Print “Underflow”
cout<<"Stack Underflow"<<endl;
Goto Step 3 else
Step-2: Set Val= Stack[TOP] {
Step-3: Set top= top – 1 cout<<"The popped element is "<< stack[top] <<endl;

Step-4: End top--;

}
}
Operations on Stack
isEmpty(): It determines whether the stack is empty or not.

isFull(): It determines whether the stack is full or not.'

isEmpty () Operation Algorithm: isFull () Operation Algorithm:

Step-1: If top = -1 or top= NULL Step-1: If top = Max-1

Print “Underflow” Print “Overflow”

Step-2 : Stop Step 2: Stop

Operations on Stack

peek() − Accessing the top data element of the stack,

without removing it.

Algorithm:
Step-1: If TOP = NULL
PRINT “Stack is Empty”
Goto Step 3
Step-2: Return Stack[TOP]
Step-3: END
Operations on Stack

• count(): It returns the total number of elements available in a stack.

• change(): It changes the element at the given position.

• display() or Traverse(): It prints all the elements available in the stack.

Stack Operation: Traversal
void traverse() {
if(top>= 0) {
cout<<"Stack elements are:";
for(int i = top; i>= 0; i--)
cout<<stack[i]<<" ";
cout<<endl;
}
else
cout<<"Stack is empty";
}
Applications of Stack

1) Balancing of symbols
During compilation of program, when the opening braces
come, it push the braces in a stack, and when the closing
int main() braces appear, it pop the opening braces from the stack.
{ Therefore, the net value comes out to be zero.
cout<<"Hello";
cout<<"Students"; If any symbol is left in the stack, it means that some Syntax
} Errors occurs in a program.
Applications of Stack
2) String reversal

• First, we push all the characters of the string in a stack

until we reach the null character.

• After pushing all the characters, we start taking out the

character one by one until we reach the bottom of the
stack.
Applications of Stack
2) UNDO/REDO
• We have an editor in which we write 'a', then 'b', and
then 'c'; therefore, the text written in an editor is abc.

• There are three states, a, ab, and abc, which are stored in
a stack.

• To perform Undo and Redo operations, we need 2

stacks, one stack shows UNDO state, and the other
shows REDO state.
Applications of Stack
2) UNDO/REDO
• There are three states, a, ab, and abc, If we want to perform UNDO
operation, and want to achieve 'ab' state, then we implement pop
operation.

• Push all operations to Undo stack.

c • When undo is called, pop operations from Undo stack and push it
b to Redo stack.

a
Applications of Stack
2) UNDO/REDO
• There are three states, a, ab, and abc, If we want to perform UNDO
operation, and want to achieve 'ab' state, then we implement pop
operation.

• Push all operations to Undo stack.

• When undo is called, pop operations from Undo stack and push it
b to Redo stack.

a c
• When redo is called, pop operations from Redo stack and push it
to Undo stack.
Applications of Stack
When function call happens, previous variables gets stored in the Stack

3) Recursion

• The recursion means that the function is

calling itself again.

• To maintain the previous states, the compiler Returning value from base case to Caller function

creates a system stack in which all the

previous records of the function are
maintained.
Applications of Stack
4) DFS(Depth First Search)

This search is implemented on a Graph, and Graph uses the stack data
structure.
Applications of Stack
5) Backtracking

• Exploring a route from home to Bennett

University.

• If we are moving in a particular path, and we

realize that we come on the wrong way.

• In order to come at the beginning of the path to

explore another path, we use the stack data
structure.
Applications of Stack
6) Memory management • When the function is created, all its variables are assigned in the
stack memory. When the function completed its execution, all
the variables assigned in the stack are released.

• The memory is assigned in the contiguous memory blocks. The

memory is known as stack memory as all the variables are
assigned in a function call stack memory.

• The memory size assigned to the program is known to the

compiler.
Applications of Stack
7) Expression Conversion Ex- 2 + 4

Stack is also used for expression conversion. This is one of the most
important applications of stack.

Ex- 2 + 4  24+
(Infix Notation) (Postfix Notation)
Understanding Polish Notation
• Polish Notation in the data structure is a method of
expressing mathematical, logical, and algebraic equations
universally.

• This notation is used by the compiler to evaluate

mathematical equations based on their order of operations.

• When parsing mathematical expressions, three types of

notations are commonly
used : Infix Notation, Prefix Notation, and Postfix Notation.
Importance of Polish Notation

If the expression is: 4 + 6 * 2

Output ?? 16

20

Results Depend on the Order

Importance of Polish Notation

If the expression is: (4 + 6) * 2

Output ?? 16

20

Results Depend on the Order

Operator Precedence Rules
Operators Symbols

Parenthesis ( ), {}, [ ]

Exponents ^

Multiplication and Division *, /

Addition and Subtraction +,-

Importance of Polish Notation
If the expression is: 2^2^3

Output ?? 4^3 = 64

2^8 = 256

Results Depend on the Order

Associativity of Operators
Operators Symbols Associativity

Parenthesis ( ), {}, [ ] Left to Right

Exponents ^ Right to Left*

Multiplication and Division *, / Left to Right

Addition and Subtraction +,- Left to Right

*Exponential operator associativity changes with the language used. There is no standard guideline.
Expression Conversion using Stack

• Infix to prefix

• Infix to postfix

• Prefix to infix

• Prefix to postfix

• Postfix to infix
Infix to Postfix Conversion

Example: a* (b+c+d)  abc+d+*

Infix to Postfix Conversion
Example: a* (b+c+d)  abc+d+*

Step 1
Scan the expression from left to right

Step 2
If the reading symbol is an operand,
then immediately append it to the
Postfix Expression.
Infix to Postfix Conversion

Step 3
If the reading symbol is any operator +, –, *, /, then
Push it onto the Stack.

However, first, pop the operators which are already on

the stack that have higher or equal precedence than
the current operator and append them to the postfix.

If an open parenthesis ‘(‘ is there on top of the stack

then push the operator into the stack.
Infix to Postfix Conversion

Step 4
If the reading symbol is left
parenthesis ‘( ‘, then Push it
onto the Stack.
Infix to Postfix Conversion

Step 5
If the reading symbol is an
operand, then append it to the
Postfix Expression. (Step 2)
Infix to Postfix Conversion
Step 6
If the reading symbol is any operator +, –, *, /, then
Push it onto the Stack.

However, first, pop the operators which are already

on the stack that have higher or equal precedence
3
than the current operator and append them to the
postfix.

If an open parenthesis ‘(‘ is there on top of the stack

then push the operator into the stack.
Infix to Postfix Conversion

Step 6
If the reading symbol is an operand, then
append it to the Postfix Expression. (Step 2)
Infix to Postfix Conversion
Step 7
If the reading symbol is any operator +, –, *, /,
then Push it onto the Stack.

However, first, pop the operators which are

already on the stack that have higher or equal
precedence than the current operator and
append them to the postfix.

If an open parenthesis ‘(‘ is there on top of the

stack then push the operator into the stack.
Infix to Postfix Conversion

Step 8
If the reading symbol is an operand, then
append it to the Postfix Expression. (Step 2)
Infix to Postfix Conversion

Step 9
:If the reading symbol is right parenthesis ‘)’,
then Pop all the contents of the stack until
the respective left parenthesis is popped and -9
append each popped symbol to Postfix
Expression.
Infix to Postfix Conversion

Step 10
If the input is over, pop all the
remaining symbols from the stack
and append them to the postfix.
Algorithm of Infix to Postfix Conversion

Step 1: Scan all the symbols one by one from left to right in the given Infix Expression. If the reading symbol is an operand, then
immediately append it to the Postfix Expression.

Step 2: If the reading symbol is left parenthesis ‘( ‘, then Push it onto the Stack.

Step 3: If the reading symbol is right parenthesis ‘)’, then Pop all the contents of the stack until the respective left parenthesis is popped
and append each popped symbol to Postfix Expression.

Step 4: If the reading symbol is an operator (+, –, *, /), then Push it onto the Stack. However, first, pop the operators which are already
on the stack that have higher or equal precedence than the current operator and append them to the postfix. If an open parenthesis is there
on top of the stack then push the operator into the stack.

Step 5: If the input is over, pop all the remaining symbols from the stack and append them to the postfix.
Infix to Postfix Conversion

Example: a* (b+c+d)  abc+d+*

Shortcut Approach

a* (b+c+d)  a* ((b+c)+d))

 a* ((bc+) +d)

 a*(bc+d+)

 abc+d+*
Advantage of Postfix Expression over Infix Exp

Example: a* (b+c+d)  abc+d+*

•Postfix Expressions does not require the usage of the parenthesis which are
necessary in case of infix expression.

•In postfix expression, there are no operator precedence rules. So, the
order of operations is always clear.

•Postfix Expressions are easier to evaluate using a stack-based solution.

Assessment Time

Problem 1:
Infix: (a+b)*c
Postfix:?????

Output: ab+c*
Assessment Time

Problem 2:
Infix: a*b+c-d
Postfix:?????

Output: ab*c+d-
KBC Assessment Time

Problem 3

Infix: a + b * (c / (d ^ e)) ^ ((f * g) – h)

Postfix: ?????

Output: abcde^/fg*h-^*+