Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

NOTE: Code must work in netbeans Write a program that uses a stack to reverse its inputs. Your stack must be generic and you must

NOTE: Code must work in netbeans

Write a program that uses a stack to reverse its inputs. Your stack must be generic and you must demonstrate that it accepts both String and Integer types. Your stack must implement the following methods:

push,

pop,

isEmpty (returns true if the stack is empty and false otherwise), and

size (returns an integer value for the number of items in the stack).

You may use either an ArrayList or a LinkedList to implement your stack. Also, your pop method must throw an IndexOutOfBoundsException if the user attempts to pop something off an empty stack. Name your stack class Stack and put it in a file named Stack.java.

Create a StackTest.java file to demonstrate all of the methods of your stack. Instantiate two stacks; one for String and one for Integer. Push words/integers onto your stack. After you have pushed a series of words/integers on your stack use a while loop to pop and print each item. If your stack is working properly your inputs should print in reverse order. Be sure that you calls to pop are in a try statement and will catch the IndexOutOfBoundsException, if thrown.

Note: Java has a Stack class, but you may not use it. You must create your own Stack class and your class must have the following operations (all of which must be demonstrated): push, pop, isEmpty, and size.

Here is an example screen shot of a working stack that reverses words and integers:image text in transcribed

| | BMIS 312 Week 8 - NetBeans IDE 7.3 File Edit View Navigate Source Refactor Run Debug Profile Team Tools Window Help Q- Search (Ctrl4) defeut config Projects |Files Services a StartPage StackTest.java Stack java B-g BMIS-312-Week-1 8MIS-312-week-2 BMIS-312-week-3 BMIS-312-Week 4 62 63 64 65 System.out.print (integerStack.pop) +"") B-g BMIS ,312 ,Week-5_1 BMIS-312-week-5-2 B- catch (IndexoutorBoundsException e System.out-println(" The Integer stack is empty.": BMIS-312-Week 6 1 67 69 69 74 71 72 73 74 8MIS-312-week-6-2 System.out.println ) System.out.print f {"The BMIS-312-week-7 Integer stack 13 empty {T/F): %n", Source Packages erueFaise (integer3tack.isEmpty)) bmis_312_week7 Pair java System.out.printf("The size of the Integer tack is %d%n", integerStack.size()); ParTest.jee Libranies B- BMIS-312-week-8 StackTest > main Output BMIS_312 Weck 8 (run) Source Packages bmis 312 weck a main-Navigator Members

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image_2

Step: 3

blur-text-image_3

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Graph Databases New Opportunities For Connected Data

Authors: Ian Robinson, Jim Webber, Emil Eifrem

2nd Edition

1491930896, 978-1491930892

More Books

Students also viewed these Databases questions

Question

9. Mohawk Industries Inc.

Answered: 1 week ago

Question

8. Satyam Computer Services Limited

Answered: 1 week ago

Question

2. Explain how the role of training is changing.

Answered: 1 week ago