Presentation is loading. Please wait.

Presentation is loading. Please wait.

Chapter 6 Stacks. Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-2 Chapter Objectives Examine stack processing Define a stack abstract.

Published by Modified over 8 years ago

Similar presentations

Presentation on theme: "Chapter 6 Stacks. Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-2 Chapter Objectives Examine stack processing Define a stack abstract."— Presentation transcript:

1 Chapter 6 Stacks

2 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-2 Chapter Objectives Examine stack processing Define a stack abstract data type Demonstrate how a stack can be used to solve problems Examine various stack implementations Compare stack implementations

3 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-3 Stacks A stack is a linear collection whose elements are added and removed from one end A stack is LIFO – last in, first out The last element to be put on the stack is the first element to be removed A stack is usually depicted vertically, with additions and deletions occurring at the top of the stack

4 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-4 FIGURE 6.1 A conceptual view of a stack

5 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-5 FIGURE 6.2 The operations on a stack

6 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-6 FIGURE 6.3 The StackADT interface in UML

7 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-7 Listing 6.1

8 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-8 Using Stacks Stacks are particularly helpful when solving certain types of problems Consider the undo operation in an application – keeps track of the most recent operations in reverse order

9 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-9 Postfix Expressions Let's examine a program that uses a stack to evaluate postfix expressions In a postfix expression, the operator comes after its two operands We generally use infix notation, with parentheses to force precedence: (3 + 4) * 2 In postfix notation, this would be written 3 4 + 2 *

10 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-10 Postfix Expressions To evaluate a postfix expression: – scan from left to right, determining if the next token is an operator or operand – if it is an operand, push it on the stack – if it is an operator, pop the stack twice to get the two operands, perform the operation, and push the result onto the stack At the end, there will be one value on the stack, which is the value of the expression

11 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-11 FIGURE 6.4 Using a stack to evaluate a postfix expression

12 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-12 Postfix Expressions To simplify the example, let's assume the operands to the expressions are integer literals Our solution uses an ArrayStack, though any implementation of a stack would suffice

13 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-13 Listing 6.2

14 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-14 Listing 6.2 (cont.)

15 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-15 Listing 6.3

16 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-16 Listing 6.3 (cont.)

17 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-17 Listing 6.3 (cont.)

18 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-18 Listing 6.3 (cont.)

19 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-19 Listing 6.3 (cont.)

20 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-20 FIGURE 6.5 A UML class diagram for the postfix expression program

21 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-21 Using Stacks - Traversing a Maze A classic use of a stack is to keep track of alternatives in maze traversal or other trial and error algorithms Using a stack in this way simulates recursion – Recursion is when a method calls itself either directly or indirectly

22 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-22 Using Stacks - Traversing a Maze Run-time environments keep track of method calls by placing an activation record for each called method on the run-time stack When a method completes execution, it is popped from the stack and control returns to the method that called it – Which is now the activation record on the top of the stack

23 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-23 Using Stacks - Traversing a Maze In this manner, we can traverse a maze by trial and error by using a stack to keep track of moves that have not yet been tried

24 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-24 Listing 6.4

25 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-25 Listing 6.4 (cont.)

26 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-26 Listing 6.4 (cont.)

27 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-27 Listing 6.4 (cont.)

28 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-28 Listing 6.4 (cont.)

29 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-29 Listing 6.5

30 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-30 Listing 6.5 (cont.)

31 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-31 The LinkedStack Class Now let's examine a linked implementation of a stack We will reuse the LinearNode class that we used in Chapter 3 to define the linked implementation of a set collection Internally, a stack is represented as a linked list of nodes, with a reference to the top of the stack and an integer count of the number of nodes in the stack

32 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-32 FIGURE 6.6 A linked implementation of a stack

33 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-33 LinkedStack - the push Operation

34 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-34 FIGURE 6.7 The stack after pushing element E

35 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-35 LinkedStack - the pop Operation

36 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-36 FIGURE 6.8 The stack after a pop operation

37 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-37 The ArrayStack Class Now let's examine an array-based implementation of a stack We'll make the following design decisions: – maintain an array of Object references – the bottom of the stack is at index 0 – the elements of the stack are in order and contiguous – an integer variable top stores the index of the next available slot in the array This approach allows the stack to grow and shrink at the higher indexes

38 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-38 FIGURE 6.9 An array implementation of a stack

39 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-39 ArrayStack - the push Operation //----------------------------------------------------------------- // Adds the specified element to the top of the stack, expanding // the capacity of the stack array if necessary. //----------------------------------------------------------------- public void push (T element) { if (size() == stack.length) expandCapacity(); stack[top] = element; top++; }

40 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-40 FIGURE 6.10 The stack after pushing element E

41 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-41 ArrayStack - the pop Operation

42 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-42 FIGURE 6.11 The stack after popping the top element

43 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-43 The java.util.Stack Class The Java Collections framework defines a Stack class with similar operations It is derived from the Vector class and therefore has some characteristics that are not appropriate for a pure stack The java.util.Stack class has been around since the original version of Java, and has been retrofitted to meld with the Collections framework

44 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-44 FIGURE 6.12 A UML description of the java.util.Stack class

45 Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-45 Analysis of Stack Operations Because stack operations all work on one end of the collection, they are generally efficient The push and pop operations, for both linked and array implementations, are O(1) Likewise, the other operations for all implementations are O(1) We'll see that other collections (which don't have that characteristic) aren't as efficient for all operations

Download ppt "Chapter 6 Stacks. Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-2 Chapter Objectives Examine stack processing Define a stack abstract."

Similar presentations

TK1924 Program Design & Problem Solving Session 2011/2012

TK1924 Program Design & Problem Solving Session 2011/2012
C o n f i d e n t i a l Developed By Nitendra NextHome Subject Name: Data Structure Using C Title : Overview of Stack.

C o n f i d e n t i a l Developed By Nitendra NextHome Subject Name: Data Structure Using C Title : Overview of Stack.
Chapter 7 Queues. Copyright © 2004 Pearson Addison-Wesley. All rights reserved.1-2 Chapter Objectives Examine queue processing Define a queue abstract.

Chapter 7 Queues. Copyright © 2004 Pearson Addison-Wesley. All rights reserved.1-2 Chapter Objectives Examine queue processing Define a queue abstract.
Chapter 6 Linked Structures © 2006 Pearson Education Inc., Upper Saddle River, NJ. All rights reserved.

Chapter 6 Linked Structures © 2006 Pearson Education Inc., Upper Saddle River, NJ. All rights reserved.
Stacks Chapter 5. Chapter Objectives  To learn about the stack data type and how to use its four methods: push, pop, peek, and empty  To understand.

Stacks Chapter 5. Chapter Objectives  To learn about the stack data type and how to use its four methods: push, pop, peek, and empty  To understand.
Stacks Chapter 5. Chapter 5: Stacks2 Chapter Objectives To learn about the stack data type and how to use its four methods: push, pop, peek, and empty.

Stacks Chapter 5. Chapter 5: Stacks2 Chapter Objectives To learn about the stack data type and how to use its four methods: push, pop, peek, and empty.
© 2006 Pearson Addison-Wesley. All rights reserved7 B-1 Chapter 7 (continued) Stacks.

© 2006 Pearson Addison-Wesley. All rights reserved7 B-1 Chapter 7 (continued) Stacks.
Chapter 3 Collections. Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 3-2 Chapter Objectives Define the concept and terminology related.

Chapter 3 Collections. Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 3-2 Chapter Objectives Define the concept and terminology related.
© 2006 Pearson Addison-Wesley. All rights reserved7A-1 Chapter 7 Stacks.

© 2006 Pearson Addison-Wesley. All rights reserved7A-1 Chapter 7 Stacks.
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,

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,
Chapter 10 Recursion. Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 10-2 Chapter Objectives Explain the underlying concepts of recursion.

Chapter 10 Recursion. Copyright © 2005 Pearson Addison-Wesley. All rights reserved Chapter Objectives Explain the underlying concepts of recursion.
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,

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,
CHAPTER 6 Stacks Array Implementation. 2 Stacks A stack is a linear collection whose elements are added and removed from one end The last element to be.

CHAPTER 6 Stacks Array Implementation. 2 Stacks A stack is a linear collection whose elements are added and removed from one end The last element to be.
Chapter 4 Linked Structures. Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 4-2 Chapter Objectives Describe the use of references to create.

Chapter 4 Linked Structures. Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 4-2 Chapter Objectives Describe the use of references to create.
1 Stacks Stack Applications Evaluating Postfix Expressions Introduction to Project 2 Reading: L&C Section 3.2, 3.4-3.8.

1 Stacks Stack Applications Evaluating Postfix Expressions Introduction to Project 2 Reading: L&C Section 3.2,
CHAPTER 6 Stacks. 2 A stack is a linear collection whose elements are added and removed from one end The last element to be put on the stack is the first.

CHAPTER 6 Stacks. 2 A stack is a linear collection whose elements are added and removed from one end The last element to be put on the stack is the first.
Chapter 6 Stacks. © 2005 Pearson Addison-Wesley. All rights reserved6-2 The Abstract Data Type Specifications of an abstract data type for a particular.

Chapter 6 Stacks. © 2005 Pearson Addison-Wesley. All rights reserved6-2 The Abstract Data Type Specifications of an abstract data type for a particular.
Chapter 12 Trees. Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 12-2 Chapter Objectives Define trees as data structures Define the terms.

Chapter 12 Trees. Copyright © 2005 Pearson Addison-Wesley. All rights reserved Chapter Objectives Define trees as data structures Define the terms.
Chapter 8 Lists. Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 8-2 Chapter Objectives Examine list processing and various ordering techniques.

Chapter 8 Lists. Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 8-2 Chapter Objectives Examine list processing and various ordering techniques.
Liang, Introduction to Java Programming, Tenth Edition, (c) 2013 Pearson Education, Inc. All rights reserved. 1 Chapter 20 Lists, Stacks, Queues, and Priority.

Liang, Introduction to Java Programming, Tenth Edition, (c) 2013 Pearson Education, Inc. All rights reserved. 1 Chapter 20 Lists, Stacks, Queues, and Priority.

Similar presentations

Ads by Google