Data Structures and Algorithms

Objectives In this session, you will learn to:

Identify the features of a stack Implement stacks Apply stacks to solve programming problems

Ver. 1.0

Session 10

Data Structures and Algorithms

Stacks Let us play the game of Rummy.
7 7 6 6 6 7 6 6 6

7 6 7 6

Ver. 1.0

Session 10

Data Structures and Algorithms

Defining a Stack What is a a collection of data items that can be accessed at A stack is Stack ? only one end, called top. Items can be inserted and deleted in a stack only at the top. The last item inserted in a stack is the first one to be deleted. Therefore, a stack is called a Last-In-First-Out (LIFO) data structure.

Ver. 1.0

Session 10

Data Structures and Algorithms

Identifying the Operations on Stacks PUSH: It two process of inserting are performed There areis thebasic operations that a new element on the top of a stacks: stack.
PUSH POP
Push an

Empty Stack

Element 1

Ver. 1.0

Session 10

Data Structures and Algorithms

Identifying the Operations on Stacks (Contd.) PUSH: It is the process of inserting a new element on the top of a stack.
Push an Push an Element 2 Element 3

3 2 1

Ver. 1.0

Session 10

Data Structures and Algorithms

Identifying the Operations on Stacks (Contd.) POP: It is the process of deleting an element from the top of a stack.

POP an Element 3 3 2 1 2

Ver. 1.0

Session 10

Data Structures and Algorithms

Just a minute Elements in stacks are inserted and deleted on a ___________ basis.

Answer:
LIFO

Ver. 1.0

Session 10

Data Structures and Algorithms

Just a minute List down some real life examples that work on the LIFO principle. Answer:
Pile of books: Suppose a set of books are placed one over the other in a pile. When you remove books from the pile, the topmost book will be removed first. Similarly, when you have to add a book to the pile, the book will be placed at the top of the pile. Pile of plates: The first plate begins the pile. The second plate is placed on the top of the first plate and the third plate is placed on the top of the second plate, and so on. In general, if you want to add a plate to the pile, you can keep it on the top of the pile. Similarly, if you want to remove a plate, you can remove the plate from the top of the pile. Bangles in a hand: When a person wears bangles, the last bangle worn is the first one to be removed.
Ver. 1.0

Session 10

Data Structures and Algorithms

Implementing Stacks You need to develop a method to check if the parentheses in an arithmetic expression are correctly nested. How will you solve this problem? You can solve this problem easily by using a stack.

Ver. 1.0

Session 10

Data Structures and Algorithms

Implementing Stacks (Contd.) Consider an example. Suppose the expression is:
{(a + b) (c + d) + (c d)]}

{(a + b) (c + d) + (c d)]}

Scan the expression from left to right. The first entry to be scanned is {, which is a left parenthesis. Push it into the stack.
{

Ver. 1.0

Session 10

Data Structures and Algorithms

Implementing Stacks (Contd.) The next entry to be scanned is (, which is a left parenthesis. Push it into the stack. The next entry is a, which is an operand. Therefore, it is discarded. The next entry is +, which is an operator. Therefore, it is discarded. The next entry is b, which is an operand. Therefore, it is discarded. {(a + b) (c + d) + (c d)]}

( {

Ver. 1.0

Session 10

Data Structures and Algorithms

Implementing Stacks (Contd.) The next entry to be scanned is ), which is a right parenthesis POP the topmost entry from the stack. Match the two brackets. {(a + b) (c + d) + (c d)]}

Brackets Matched
( {

Ver. 1.0

Session 10

Data Structures and Algorithms

Implementing Stacks (Contd.) The next entry to be scanned {(a + b) (c + d) + (c d)]} is , which is an operator. Therefore, it is discarded. The next entry to be scanned is (, which is a left parenthesis Push it into the stack The next entry to be scanned is c, which is an operand. Therefore it is discarded ( The next entry to be scanned { is +, which is an operator. Therefore it is discarded The next entry to be scanned is d, which is an operand. Therefore it is discarded
Ver. 1.0

Session 10

Data Structures and Algorithms

Implementing Stacks (Contd.) The next entry to be scanned is ), which is a right parenthesis. POP the topmost element from the stack. Match the two brackets. {(a + b) (c + d) + (c d)]}

Brackets Matched
( {

Ver. 1.0

Session 10

Data Structures and Algorithms

Implementing Stacks (Contd.) The next entry to be scanned {(a + b) (c + d) + (c d)]} is +, which is an operator. Therefore, it is discarded. The next entry to be scanned is (, which is a left parenthesis. Push it into the stack. The next entry to be scanned is c, which is an operand. Therefore, it is discarded. ( The next entry to be scanned { is , which is an operator. Therefore, it is discarded. The next entry to be scanned is d, which is an operand. Therefore, it is discarded.
Ver. 1.0

Session 10

Data Structures and Algorithms

Implementing Stacks (Contd.) The next entry to be scanned is ), which is a right parenthesis. POP the topmost element from the stack. Match the two brackets. {(a + b) (c + d) + (c d)]}

Brackets Matched
( {

Ver. 1.0

Session 10

Data Structures and Algorithms

Implementing Stacks (Contd.) The next entry to be scanned is ], which is a right parenthesis. POP the topmost element from the stack. Match the two brackets. {(a + b) (c + d) + (c d)]}

Brackets Do Not Match The Expression is INVALID

{

Ver. 1.0

Session 10

Data Structures and Algorithms

Implementing a Stack Using an Array A stack is similarstack list in which insertion and deletion is To implement a to a using an array: allowed only atarray: end. Declare an one int similar to list, stack can be implemented using Therefore,Stack[5];a // Maximum size needs to be specified in both arrays and linked lists. // advance
Declare a variable, top to hold the index of the topmost element in the stacks: int top; Initially, when the stack is empty, set: top = 1

Ver. 1.0

Session 10

Data Structures and Algorithms

Implementing a Stack Using an Array (Contd.) Let us now write an algorithm for the PUSH operation.
Initially: top = 1 PUSH an element 3

1. 2.

Increment top by 1. Store the value to be pushed at index top in the array. Top now contains the index of the topmost element.

0
Stack

Ver. 1.0

Session 10

Data Structures and Algorithms

Implementing a Stack Using an Array (Contd.)

1. 1.

Increment top by 1. Store the value to be pushed at index top in the array. Top now contains the index of the topmost element.

top = 1 PUSH an element 3

0
Stack

1 10

Ver. 1.0

Session 10

Data Structures and Algorithms

Implementing a Stack Using an Array (Contd.)

1. 1.

Increment top by 1. Store the value to be pushed at index top in the array. Top now contains the index of the topmost element.

top = 0 PUSH an element 3

0
Stack

1 10

top = 0

Ver. 1.0

Session 10

Data Structures and Algorithms

Implementing a Stack Using an Array (Contd.)

1. 1.

Increment top by 1. Store the value to be pushed at index top in the array. Top now contains the index of the topmost element.

PUSH an element 3

0
Stack 3 10 top = 0

4
Item pushed

Ver. 1.0

Session 10

Data Structures and Algorithms

Implementing a Stack Using an Array (Contd.)

1. 2.

Increment top by 1. Store the value to be pushed at index top in the array. Top now contains the index of the topmost element.

PUSH an element 8

0
Stack 3 10 top = 0

Ver. 1.0

Session 10

Data Structures and Algorithms

Implementing a Stack Using an Array (Contd.)

1. 1.

Increment top by 1. Store the value to be pushed at index top in the array. Top now contains the index of the topmost element.

PUSH an element 8

0
Stack 3 10

top = 0 = 1 top

Ver. 1.0

Session 10

Data Structures and Algorithms

Implementing a Stack Using an Array (Contd.)

1. 1.

Increment top by 1. Store the value to be pushed at index top in the array. Top now contains the index of the topmost element.

PUSH an element 8

0
Stack

4
Item pushed

3 10 8 top = 1

Ver. 1.0

Session 10

Data Structures and Algorithms

Implementing a Stack Using an Array (Contd.)

1. 2.

Increment top by 1. Store the value to be pushed at index top in the array. Top now contains the index of the topmost element.

PUSH an element 5

0
Stack

3 10 8 top = 1

Ver. 1.0

Session 10

Data Structures and Algorithms

Implementing a Stack Using an Array (Contd.)

1. 1.

Increment top by 1. Store the value to be pushed at index top in the array. Top now contains the index of the topmost element.

PUSH an element 5

0
Stack

3 10 8 top = top = 2 1

Ver. 1.0

Session 10

Data Structures and Algorithms

Implementing a Stack Using an Array (Contd.)

1. 1.

Increment top by 1. Store the value to be pushed at index top in the array. Top now contains the index of the topmost element.

PUSH an element 5

0
Stack

2
5 top = 2

4
Item pushed

3 10 8

Ver. 1.0

Session 10

Data Structures and Algorithms

Implementing a Stack Using an Array (Contd.)

1. 2.

Increment top by 1. Store the value to be pushed at index top in the array. Top now contains the index of the topmost element.

PUSH an element 1

0
Stack

2
5 top = 2

3 10 8

Ver. 1.0

Session 10

Data Structures and Algorithms

Implementing a Stack Using an Array (Contd.)

1. 1.

Increment top by 1. Store the value to be pushed at index top in the array. Top now contains the index of the topmost element.

PUSH an element 1

0
Stack

2
5

3 10 8

top = 2 = 3 top

Ver. 1.0

Session 10

Data Structures and Algorithms

Implementing a Stack Using an Array (Contd.)

1. 1.

Increment top by 1. Store the value to be pushed at index top in the array. Top now contains the index of the topmost element.

PUSH an element 1

0
Stack

2
5

3
1 top = 3

4
Item pushed

3 10 8

Ver. 1.0

Session 10

Data Structures and Algorithms

Implementing a Stack Using an Array (Contd.)

1. 2.

Increment top by 1. Store the value to be pushed at index top in the array. Top now contains the index of the topmost element.

PUSH an element 9

0
Stack

2
5

3
1 top = 3

3 10 8

Ver. 1.0

Session 10

Data Structures and Algorithms

Implementing a Stack Using an Array (Contd.)

1. 1.

Increment top by 1. Store the value to be pushed at index top in the array. Top now contains the index of the topmost element.

PUSH an element 9

0
Stack

2
5

3
1

3 10 8

top top = 3 = 4

Ver. 1.0

Session 10

Data Structures and Algorithms

Implementing a Stack Using an Array (Contd.)

1. 1.

Increment top by 1. Store the value to be pushed at index top in the array. Top now contains the index of the topmost element.

PUSH an element 9

0
Stack

2
5

3
1

4
9 top = 4 Item pushed

3 10 8

Ver. 1.0

Session 10

Data Structures and Algorithms

Implementing a Stack Using an Array (Contd.)

1. 2.

Increment top by 1. Store the value to be pushed at index top in the array. Top now contains the index of the topmost element.

PUSH an element 2

0
Stack

2
5

3
1

4
9 top = 4

3 10 8

Ver. 1.0

Session 10

Data Structures and Algorithms

Implementing a Stack Using an Array (Contd.)

1. 1.

Increment top by 1. Store the value to be pushed at index top in the array. Top now contains the index of the topmost element.

PUSH an element 2

0
Stack

2
5

3
1

4
9 top = 5 top = 4

3 10 8

Ver. 1.0

Session 10

Data Structures and Algorithms

Implementing a Stack Using an Array (Contd.)

1. 1.

Increment top by 1. Store the value to be pushed at index top in the array. Top now contains the index of the topmost element.

PUSH an element 2

0
Stack

2
5

3
1

4
9 top = 5 Stack overflow

3 10 8

Ver. 1.0

Session 10

Data Structures and Algorithms

Implementing a Stack Using an Array (Contd.) The stack has been implemented To avoid the stack overflow, you in an array of for 5. need to checksizethe stack full condition before pushing an element Therefore, you cannot store more into theelements in the stack. than 5 stack. Let us modify the algorithm to check for this condition.

1. 2. 2. 3.

Increment topby 1. If top = MAX 1: a. Display Stack Full Store the value to be b. Exit pushed at index top in the array. Top now Increment top by 1 contains the index of the topmost element. be Store the value to pushed at index top in the array

0
Stack

2
5

3
1

4
9

3 10 8

Ver. 1.0

Session 10

Data Structures and Algorithms

Implementing a Stack Using an Array (Contd.) Write an algorithm to implement the POP operation on a stack. Algorithm for POP operation:
1. If top = 1:
a. Display Stack Empty b. Exit

2. Retrieve the value stored at index top 3. Decrement top by 1

Ver. 1.0

Session 10

Data Structures and Algorithms

Just a minute In a stack, data can be stored and removed only from one end of the stack called the ______ of the stack.

Answer:
top

Ver. 1.0

Session 10

Data Structures and Algorithms

Implementing a Stack Using a Linked List Write an algorithm to implement theas follows: The algorithm for PUSH operation isPUSH and POP POP operation is as follows: operations variable/pointer tmp point to the topmost node. Make a memory for the List. 1. Allocateusing a Linked new node.
Retrieve the to the data field of the new node. 2. Assign valuevalue contained in the topmost node. 3. Make the next field of nextnew node point to top. top point to the the node in sequence. 4. Make topmemory allocatednode. node marked by tmp. Release point to the new to the

Ver. 1.0

Session 10

Data Structures and Algorithms

Activity: Implementing a Stack Using an Array Problem Statement:
Write a program to implement a stack by using an array that can store five elements.

Ver. 1.0

Session 10

Data Structures and Algorithms

Activity: Implementing a Stack Using a Linked List Problem Statement:
Write a program to implement a stack by using a linked list.

Ver. 1.0

Session 10

Data Structures and Algorithms

Just a minute What will be the condition for stack full in a stack implemented as a linked list?

Answer:
When a stack is implemented as a linked list, there is no upper bound limit on the size of the stack. Therefore, there will be no stack full condition in this case.

Ver. 1.0

Session 10

Data Structures and Algorithms

Just a minute If a stack is represented in memory by using a linked list, then insertion and deletion of data will be done ________.
1. 2. 3. 4. At the end of the list At the beginning of the list Anywhere in the list At the beginning and at the end of the list respectively

Answer:
2. At the beginning of the list

Ver. 1.0

Session 10

Data Structures and Algorithms

Applications of Stacks Some of the applications of stacks are:
Implementing function calls Maintaining the UNDO list for an application Checking the nesting of parentheses in an expression Evaluating expressions

Ver. 1.0

Session 10

Data Structures and Algorithms

Implementing Function Calls Implementing function calls:
Consider an example. There are three functions, F1, F2, and F3. Function F1 invokes F2 and function F2 invokes F3, as shown.

Ver. 1.0

Session 10

Data Structures and Algorithms

Implementing Function Calls (Contd.)
void F1() { 1100 int x; 1101 x = 5; 1102 F2(); 1103 print(x); } void F2(int x) { 1120 x = x + 5; 1121 F3(x); 1122 print(x); } void F3(int x) { 1140 x = x 2; 1141 print x; }
Ver. 1.0

Assuming these instructions at the given locations in the memory.

Session 10

Data Structures and Algorithms

Implementing Function Calls (Contd.)
void F1() { 1100 int x; 1101 x = 5; 1102 F2(); 1103 print(x); } void F2(int x) { 1120 x = x + 5; 1121 F3(x); 1122 print(x); } void F3(int x) { 1140 x = x 2; 1141 print x; }
Ver. 1.0

The execution starts from function F1

Session 10

Data Structures and Algorithms

Implementing Function Calls (Contd.)
void F1() { 1100 int x; 1101 x = 5; 1102 F2(); 1103 print(x); } void F2(int x) { 1120 x = x + 5; 1121 F3(x); 1122 print(x); } void F3(int x) { 1140 x = x 2; 1141 print x; }
Ver. 1.0

Session 10

Data Structures and Algorithms

Implementing Function Calls (Contd.)
void F1() { 1100 int x; 1101 x = 5; 1102 F2(); 1103 print(x); } void F2(int x) { 1120 x = x + 5; 1121 F3(x); 1122 print(x); } void F3(int x) { 1140 x = x 2; 1141 print x; }
Ver. 1.0

x=5

Session 10

Data Structures and Algorithms

Implementing Function Calls (Contd.)
void F1() { 1100 int x; 1101 x = 5; 1102 F2(); 1103 print(x); } void F2(int x) { 1120 x = x + 5; 1121 F3(x); 1122 print(x); } void F3(int x) { 1140 x = x 2; 1141 print x; }
Ver. 1.0

x=5

1103, x = 5

Address and the local variable of F1

Session 10

Data Structures and Algorithms

Implementing Function Calls (Contd.)
void F1() { 1100 int x; 1101 x = 5; 1102 F2(); 1103 print(x); } void F2(int x) { 1120 x = x + 5; 1121 F3(x); 1122 print(x); } void F3(int x) { 1140 x = x 2; 1141 print x; }
Ver. 1.0

x = 10 5

1103, x = 5

Session 10

Data Structures and Algorithms

Implementing Function Calls (Contd.) x = 10 void F1() { 1100 int x; 1101 x = 5; 1102 F2(); 1103 print(x); } void F2(int x) { 1122, x = 10 1120 x = x + 5; 1103, x = 5 1121 F3(x); 1122 print(x); Address and the local variable of F2 } void F3(int x) { 1140 x = x 2; 1141 print x; }
Ver. 1.0

Session 10

Data Structures and Algorithms

Implementing Function Calls (Contd.) x = 10 20 void F1() { 1100 int x; 1101 x = 5; 1102 F2(); 1103 print(x); } void F2(int x) { 1122, x = 10 1120 x = x + 5; 1103, x = 5 1121 F3(x); 1122 print(x); Address and the local variable of F2 } void F3(int x) { 1140 x = x 2; 1141 print x; }
Ver. 1.0

Session 10

Data Structures and Algorithms

Implementing Function Calls (Contd.)
void F1() { 1100 int x; 1101 x = 5; 1102 F2(); 1103 print(x); } void F2(int x) { 1120 x = x + 5; 1121 F3(x); 1122 print(x); } void F3(int x) { 1140 x = x 2; 1141 print x; }
Ver. 1.0

x = 10 20

1122, x = 10 1122, x = 10 1103, x = 5

20
Session 10

Data Structures and Algorithms

Implementing Function Calls (Contd.)
void F1() { 1100 int x; 1101 x = 5; 1102 F2(); 1103 print(x); } void F2(int x) { 1120 x = x + 5; 1121 F3(x); 1122 print(x); } void F3(int x) { 1140 x = x 2; 1141 print x; }
Ver. 1.0

x = 10 5

1103, x = 5

1103, x = 5

20

10
Session 10

Data Structures and Algorithms

Implementing Function Calls (Contd.)
void F1() { 1100 int x; 1101 x = 5; 1102 F2(); 1103 print(x); } void F2(int x) { 1120 x = x + 5; 1121 F3(x); 1122 print(x); } void F3(int x) { 1140 x = x 2; 1141 print x; }
Ver. 1.0

x=5

20

10

5
Session 10

Data Structures and Algorithms

Maintaining the UNDO list for an Application Maintaining the UNDO list for an application:
Consider that you made some changes in a Word document. Now, you want to revert back those changes. You can revert those changes with the help of an UNDO feature. The UNDO feature reverts the changes in a LIFO manner. This means that the change that was made last is the first one to be reverted. You can implement the UNDO list by using a stack.

Ver. 1.0

Session 10

Data Structures and Algorithms

Checking the Nesting of Parentheses in an Expression Checking the nesting of parentheses in an expression:
You can do this by checking the following two conditions:
The number of left parenthesis should be equal to the number of right parenthesis. Each right parenthesis is preceded by a matching left parenthesis.

Ver. 1.0

Session 10

Data Structures and Algorithms

Evaluating Expressions Evaluating an expression by using stacks:
Stacks can be used to solve complex arithmetic expressions. The evaluation of an expression is done in two steps:
Conversion of the infix expression into a postfix expression. Evaluation of the postfix expression.

Ver. 1.0

Session 10

Data Structures and Algorithms

Activity: Implementing a Stack using a Linked List Problem Statement:
Write a program that accepts an infix expression, and then converts it into a postfix expression. You can assume that the entered expression is a valid infix expression.

Ver. 1.0

Session 10

Data Structures and Algorithms

Summary In this session, you learned that:
A stack is a collection of data items that can be accessed at only one end, called top. The last item inserted in a stack is the first one to be deleted. A stack is called a LIFO data structure. There are two operations that can be performed on stacks. They are:
PUSH POP

Stacks can be implemented by using both arrays and linked lists.

Ver. 1.0

Session 10

Data Structures and Algorithms

Summary (Contd.)
Stacks are used in many applications. Some of the application domains of stacks are as follows:
Implementing function calls Maintaining the UNDO list for an application Checking the nesting of parentheses in an expression Evaluating expressions

Ver. 1.0

Session 10