MyProgrammingLab with Pearson eText -- Access Code Card -- for Building Java Programs
MyProgrammingLab with Pearson eText -- Access Code Card -- for Building Java Programs
5th Edition
ISBN: 9780135472460
Author: REGES, Stuart, Stepp, Marty
Publisher: PEARSON
Question
Book Icon
Chapter 14, Problem 5E
Program Plan Intro

Check whether two stacks are equal

Program plan:

  • Import necessary packages.
  • Create a class “Equalstack”,
    • Define the method “equals ()” that accepts two stacks of integers,
      • Construct “Stack” object.
      • Set the Boolean value to “true”.
      • Execute while both stacks are non-empty,
        • Assign the element removed from the first stack.
        • Assign the element removed from the second stack.
        • Check whether the elements are equal,
          • Set the Boolean value to “false”.
        • Insert the element of first stack to new stack.
        • Insert the element of second stack to new stack.
      • Assign the Boolean value.
      • Execute till new stack becomes empty,
        • Insert the element removed from the new stack into the second stack.
        • Insert the element removed from the new stack into the first stack.
      • Return the Boolean value.
    • Define the method “main()”,
      • Create two objects for “Stack”.
      • Add integers into the first stack.
      • Add integers into the second stack.
      • Print the first stack of integers.
      • Print the second stack of integers.
      • Assign the Boolean value returned from the method “equals()” when calling two stacks as parameters.
      • Check whether the returned value is “true”,
        • If it is true. Print the message “Both stacks are equal”.
      • Otherwise,
        • Print the message “Both stacks are not equal”.

Blurred answer
Students have asked these similar questions
I need help creating the network diagram and then revising it for the modified activity times.
Activity No. Activity Time (weeks) Immediate Predecessors 1 Requirements collection 3 2 Requirements structuring 4 1 3 Process analysis 3 2 4 Data analysis 3 2 5 Logical design 50 3,4 6 Physical design 5 5 7 Implementation 6 6 c. Using the information from part b, prepare a network diagram. Identify the critical path.
Given the following Extended-BNF grammar of the basic mathematical expressions:  Show the derivation steps for the expression: ( 2 + 3 ) * 6 – 20 / ( 3 + 1 ) Draw the parsing tree of this expression. SEE IMAGE
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education