Stacks Access is allowed only at one point of the structure, normally termed the top of the stack access to the most recently added item only Operations.

Slides:



Advertisements
Similar presentations
Stacks & Their Applications COP Stacks  A stack is a data structure that stores information arranged like a stack.  We have seen stacks before.
Advertisements

Stacks - 3 Nour El-Kadri CSI Evaluating arithmetic expressions Stack-based algorithms are used for syntactical analysis (parsing). For example.
Arithmetic Expressions Infix form –operand operator operand 2+3 or a+b –Need precedence rules –May use parentheses 4*(3+5) or a*(b+c)
COSC 2006 Chapter 7 Stacks III
COMPSCI 105 S Principles of Computer Science 13 Stacks.
Lecture 12 – ADTs and Stacks.  Modularity  Divide the program into smaller parts  Advantages  Keeps the complexity managable  Isolates errors (parts.
Topic 15 Implementing and Using Stacks
CS 206 Introduction to Computer Science II 03 / 06 / 2009 Instructor: Michael Eckmann.
Stacks & Queues Infix Calculator CSC 172 SPRING 2002 LECTURE 5.
Infix to postfix conversion Process the tokens from a vector infixVect of tokens (strings) of an infix expression one by one When the token is an operand.
CS 206 Introduction to Computer Science II 10 / 17 / 2008 Instructor: Michael Eckmann.
Infix, Postfix, Prefix.
Fall 2007CS 2251 Stacks Chapter 5. Fall 2007CS 2252 Chapter Objectives To learn about the stack data type and how to use its four methods: push, pop,
CS 206 Introduction to Computer Science II 03 / 16 / 2009 Instructor: Michael Eckmann.
1 CSCD 326 Data Structures I Infix Expressions. 2 Infix Expressions Binary operators appear between operands: W - X / Y - Z Order of evaluation is determined.
Implementing and Using Stacks
Topic 15 Implementing and Using Stacks
Nirmalya Roy School of Electrical Engineering and Computer Science Washington State University Cpt S 122 – Data Structures Data Structures Stacks.
CS 206 Introduction to Computer Science II 10 / 28 / 2009 Instructor: Michael Eckmann.
Comp 245 Data Structures Stacks. What is a Stack? A LIFO (last in, first out) structure Access (storage or retrieval) may only take place at the TOP NO.
Stack Applications.
1 Stacks – Chapter 3 A stack is a data structure in which all insertions and deletions of entries are made at one end, called the top of the stack. Alternatively,
CSC 205 Programming II Postfix Expressions. Recap: Stack Stack features Orderly linear structure Access from one side only – top item Stack operations.
CHAPTER 05 Compiled by: Dr. Mohammad Omar Alhawarat Stacks & Queues.
Computer Science Department Data Structure & Algorithms Problem Solving with Stack.
DATA STRUCTURE & ALGORITHMS CHAPTER 3: STACKS. 2 Objectives In this chapter, you will: Learn about stacks Examine various stack operations Discover stack.
Stacks 1. Stack  What is a stack? An ordered list where insertions and deletions occur at one end called the top. Also known as last-in-first-out (LIFO)
COP3530 Data Structures600 Stack Stack is one the most useful ADTs. Like list, it is a collection of data items. Supports “LIFO” (Last In First Out) discipline.
CSC 211 Data Structures Lecture 23
C++ Programming: From Problem Analysis to Program Design, Fourth Edition Chapter 19: Stacks and Queues (part 2)
C++ Programming: Program Design Including Data Structures, Fourth Edition Chapter 18: Stacks and Queues (part 2)
Basic Data Structures Stacks. A collection of objects Objects can be inserted into or removed from the collection at one end (top) First-in-last-out.
Data Structures & Algorithms
COMPSCI 105 SS 2015 Principles of Computer Science 09 ADT & Stacks.
Copyright © Curt Hill Stacks An Useful Abstract Data Type.
Stacks & Queues. Introduction to Stacks and Queues Widely used data structures Ordered List of element Easy to implement Easy to use.
Stacks A stack is a linear data structure that can be accessed only at one of its ends for storing and retrieving data LIFO (Last In First Out) structure.
Main Index Contents 11 Main Index Contents Stacks Further Stack Examples Further Stack Examples Pushing/Popping a Stack Pushing/Popping a Stack Class StackClass.
CC 215 DATA STRUCTURES MORE ABOUT STACK APPLICATIONS Dr. Manal Helal - Fall 2014 Lecture 6 AASTMT Engineering and Technology College 1.
Applications of Stack Maitrayee Mukerji. Stacks Last In First Out (LIFO List) ◦ FILO? Insertions and Deletions from the same end called the Top Push(),
CSC 172 DATA STRUCTURES. A TALE OF TWO STRUCTURES.
BCA II Data Structure Using C
Stacks (and Queues).
Stacks Stacks.
Revised based on textbook author’s notes.
COMPSCI 107 Computer Science Fundamentals
Infix to postfix conversion
CSE 373: Data Structures and Algorithms
CSC 172 DATA STRUCTURES.
Copyright ©2012 by Pearson Education, Inc. All rights reserved
Stacks Chapter 4.
Algorithms and Data Structures
Building Java Programs Chapter 14
Stack Data Structure, Reverse Polish Notation, Homework 7
COMPUTER 2430 Object Oriented Programming and Data Structures I
Stacks Chapter 5 Adapted from Pearson Education, Inc.
Stacks and Queues.
Stacks, Queues, and Deques
Lecture No.07 Data Structures Dr. Sohail Aslam
COMPUTER 2430 Object Oriented Programming and Data Structures I
Queue Applications Lecture 31 Mon, Apr 9, 2007.
Topic 15 Implementing and Using Stacks
Stack.
Queue Applications Lecture 31 Tue, Apr 11, 2006.
Data Structures and Algorithms 2/2561
17CS1102 DATA STRUCTURES © 2016 KL University – The contents of this presentation are an intellectual and copyrighted property of KL University. ALL RIGHTS.
Chapter 7 (continued) © 2011 Pearson Addison-Wesley. All rights reserved.
Stacks and Queues.
Stacks A stack is an ordered set of elements, for which only the last element placed into the stack is accessible. The stack data type is also known as.
Presentation transcript:

Stacks Access is allowed only at one point of the structure, normally termed the top of the stack access to the most recently added item only Operations are limited: push (add item to stack) pop (remove top item from stack) top (get top item without removing it) isEmpty Described as a "Last In First Out" (LIFO) data structure Stacks

Implementing a stack need an underlying collection to hold the elements of the stack 2 obvious choices array linked list Adding a layer of abstraction. A big idea. Stacks

Stack Implementation Implement Stack from scratch: Static: a class with internal array storage, code Dynamic: a class with internal Linkedlist storage, code Implement Stack using Inheritance Inherit from linkedlist, code Queue is similar! 3.Implementation using composition

Stack Application

Topic 15 Implementing and Using Stacks Friedrich L. Bauer German computer scientist who proposed "stack method of expression evaluation” in 1955.

Mathematical Calculations What does 3 + 2 * 4 equal? 3+ (2 * 4) ? (3 + 2) * 4? The precedence of operators affects the order of operations. A mathematical expression cannot simply be evaluated left to right. A challenge when evaluating a program. Lexical analysis is the process of interpreting a program. Stacks

Infix and Postfix Expressions The way we are use to writing expressions is known as infix notation Postfix expression does not require any precedence rules 3 2 * 1 + is postfix of 3 * 2 + 1 evaluate the following postfix expression and write out a corresponding infix expression: 2 3 2 4 * + * Stacks

Clicker Question 2 What does the following postfix expression evaluate to? 6 3 2 + * 18 36 24 11 30 Stacks

Example Infix: (4*2) +(3*4) -5 Postfix: 4 2 * 3 4 * + 5 – Evaluation of Postfix: 8 3 4 * + 5 – 8 12 + 5 – 20 5 – 15 Can make use of stack for the evaluation: whenever an operand is scanned, push into the stack, whenever a operator is scanned, pop the two operands from the stack and perform the evaluation and push the result back to the stack.

Evaluation of Postfix Expressions Eval-postfix (exp) Create a stack S For i  0 to length(exp)-1 if exp[i] is an operand S.push(exp[i]) else if exp[i] is an operator op1  S.pop() op2  S.pop() result  perform (exp[i], op1, op2) S.push(result) when the expression has been exhausted the result is the top (and only element) of the stack Stacks

Infix to Postfix Conversion Requires operator precedence parsing algorithm parse v. To determine the syntactic structure of a sentence or other utterance Operands: add to expression Operators: Have an on stack and off stack precedence Pop all stack symbols until a symbol of lower precedence appears. Then push the operator End of input: Pop all remaining stack symbols and add to the expression Stacks

Infix to postfix conversion: Example Infix expression: 6 * 2 + 3 * 4 - 5 Scanned stack Postfix Expression 6 * 2 6 2 + (pop all hp Op) 6 2 * push + 6 2 * 3 6 2 * 3 * (hp than top, push) + * 4 6 2 * 3 4 (pop all hp Op) 6 2 * 3 4 * + - 5 6 2 * 3 4 * + 5 pop all from stack 6 2 * 3 4 * + 5 -

Infix to Postfix Conversion (with parenthesis) Requires operator precedence parsing algorithm parse v. To determine the syntactic structure of a sentence or other utterance Operands: add to expression Close parenthesis: pop stack symbols until an open parenthesis appears Operators: Have an on stack and off stack precedence Pop all stack symbols until a symbol of lower precedence appears. Then push the operator End of input: Pop all remaining stack symbols and add to the expression Stacks

Infix to postfix conversion Stack Infix Expression ( a + b - c ) * d – ( e + f ) Postfix Expression

Infix to postfix conversion Stack Infix Expression a + b - c ) * d – ( e + f ) Postfix Expression (

Infix to postfix conversion Stack Infix Expression + b - c ) * d – ( e + f ) Postfix Expression a (

Infix to postfix conversion Stack Infix Expression b - c ) * d – ( e + f ) Postfix Expression a + (

Infix to postfix conversion Stack Infix Expression - c ) * d – ( e + f ) Postfix Expression a b + (

Infix to postfix conversion Stack Infix Expression c ) * d – ( e + f ) Postfix Expression a b + - (

Infix to postfix conversion Stack Infix Expression ) * d – ( e + f ) Postfix Expression a b + c - (

Infix to postfix conversion Stack Infix Expression * d – ( e + f ) Postfix Expression a b + c -

Infix to postfix conversion Stack Infix Expression d – ( e + f ) Postfix Expression a b + c - *

Infix to postfix conversion Stack Infix Expression – ( e + f ) Postfix Expression a b + c - d *

Infix to postfix conversion Stack Infix Expression ( e + f ) Postfix Expression a b + c – d * -

Infix to postfix conversion Stack Infix Expression e + f ) Postfix Expression a b + c – d * ( -

Infix to postfix conversion Stack Infix Expression + f ) Postfix Expression a b + c – d * e ( -

Infix to postfix conversion Stack Infix Expression f ) Postfix Expression a b + c – d * e + ( -

Infix to postfix conversion Stack Infix Expression ) Postfix Expression a b + c – d * e f + ( -

Infix to postfix conversion Stack Infix Expression Postfix Expression a b + c – d * e f + -

Infix to postfix conversion Stack Infix Expression Postfix Expression a b + c – d * e f + -

Infix to postfix conversion: Example Infix expression: ( a + b - c ) * d – ( e + f ) Scanned stack Postfix Expression ( a + ( + b a b - (- a b + c a b + c ) a b + c - * d a b + c - d a b + c - d* e a b + c - d* e (+ f a b + c - d* e f a b + c - d* e f +

Balanced Symbol Checking In processing programs and working with computer languages there are many instances when symbols must be balanced { } , [ ] , ( ) A stack is useful for checking symbol balance. When a closing symbol is found it must match the most recent opening symbol of the same type. Applicable to checking html and xml tags! Stacks

Algorithm for Balanced Symbol Checking Make an empty stack read symbols until end of file if the symbol is an opening symbol push it onto the stack if it is a closing symbol do the following if the stack is empty report an error otherwise pop the stack. If the symbol popped does not match the closing symbol report an error At the end of the file if the stack is not empty report an error Stacks

Algorithm in practice list[i] = 3 * ( 44 - method( foo( list[ 2 * (i + 1) + foo( list[i - 1] ) ) / 2 * ) - list[ method(list[0])]; Processing a file Tokenization: the process of scanning an input stream. Each independent chunk is a token. Tokens may be made up of 1 or more characters Stacks

Stack Operations Assume a simple stack for integers. Stack<Integer> s = new Stack<Integer>(); s.push(12); s.push(4); s.push( s.top() + 2 ); s.pop(); s.push( s.top() ); //what are contents of stack? Stacks

What is Output? Stack<Integer> s = new Stack<Integer>(); // put stuff in stack for(int i = 0; i < 5; i++) s.push( i ); // Print out contents of stack // while emptying it. // Assume there is a size method. for(int i = 0; i < s.size(); i++) System.out.print( s.pop() + “ “); A 0 1 2 3 4 D 2 3 4 B 4 3 2 1 0 E No output due C 4 3 2 to runtime error Stacks

Corrected Version Stack<Integer> s = new Stack<Integer>(); // put stuff in stack for(int i = 0; i < 5; i++) s.push( i ); // print out contents of stack // while emptying it int limit = s.size(); for(int i = 0; i < limit; i++) System.out.print( s.pop() + “ “); //or // while( !s.isEmpty() ) // System.out.println( s.pop() ); Stacks