Write a complete program that reads two stack of integers from a data file and calls a method isSame that returns true if the two stacks are the same, else false. If both stacks are empty, return true The data file is called "stackData.txt" and contains two lines of integers. The last integer is -1 on both lines to indicate end of data for each stack. The stacks may or may not be of the same size. You must make provision for file open errors using a try catch statement. The two stacks are to be returned in original condition from the method call. The only stack methods that you may use are push), pop), peek() and isEmpty(). stack 1: bottom {(28, 20, 17, 11, 8, 8, 3, 2) top stack 2: bottom {28, 28, 17, 11, 8, 8, 3, 2} top returns true stack 1: bottom (20, 20, 17, 11, 8, 8, 3, 2} top stack 2: bottom (20, -20, 17, 11, 8) top returns false. If your method modifies the stacks, you must restore them before returning. You may add a helper method that is called from isSame for data movement between data structures. Constraints: You may use one queue and one stack as auxiliary storage. Do not declare any other auxiliary data structures (e.g. arrays, Grids, ArrayLists, etc.), but you can have as many simple variables as you like.
Write a complete program that reads two stack of integers from a data file and calls a method isSame that returns true if the two stacks are the same, else false. If both stacks are empty, return true The data file is called "stackData.txt" and contains two lines of integers. The last integer is -1 on both lines to indicate end of data for each stack. The stacks may or may not be of the same size. You must make provision for file open errors using a try catch statement. The two stacks are to be returned in original condition from the method call. The only stack methods that you may use are push), pop), peek() and isEmpty(). stack 1: bottom {(28, 20, 17, 11, 8, 8, 3, 2) top stack 2: bottom {28, 28, 17, 11, 8, 8, 3, 2} top returns true stack 1: bottom (20, 20, 17, 11, 8, 8, 3, 2} top stack 2: bottom (20, -20, 17, 11, 8) top returns false. If your method modifies the stacks, you must restore them before returning. You may add a helper method that is called from isSame for data movement between data structures. Constraints: You may use one queue and one stack as auxiliary storage. Do not declare any other auxiliary data structures (e.g. arrays, Grids, ArrayLists, etc.), but you can have as many simple variables as you like.
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
Java
Transcribed Image Text:Write a complete program that reads two stack of integers from a data file and calls a method
isSame that returns true if the two stacks are the same, else false. If both stacks are empty, return
true The data file is called "stackData.txt" and contains two lines of integers. The last integer is -1 on
both lines to indicate end of data for each stack. The stacks may or may not be of the same size. You
must make provision for file open errors using a try catch statement. The two stacks are to be
returned in original condition from the method call. The only stack methods that you may use are
push(), pop(), peek() and isEmpty().
stack 1: bottom {28, 20, 17, 11, 8, 8, 3, 2} top
stack 2: bottom {20, 20, 17, 11, 8, 8, 3, 2} top
returns
ue
stack 1: bottom (20, 20, 17, 11, 8, 8, 3, 2} top
stack 2: bottom (20, -20, 17, 11, 8} top
returns false.
If your method modifies the stacks, you must restore them before returning. You may add a helper
method that is called from isSame for data movement between data structures.
Constraints: You may use one queue and one stack as auxiliary storage. Do not declare any other
auxiliary data structures (e.g. arrays, Grids, ArrayLists, etc.), but you can have as many simple
variables as you like.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education