Implement “GenericStack” using inheritance Program Plan: Include appropriate package “import java.util.Scanner” into program. Define the class named “Exercise19_02”. Define main method. Define the object “obj” for “GenericStack<String>” class. Assign the object for “Scanner” class. Prompt the user and get the strings from user and push the values into stack using “for” loop. Using “for” loop, print array elements in reverse order. Define the class “GenericStack<E>” which extends the “ArrayList<E>” class. Define the Boolean method “isEmpty()” which returns empty value. Define the Integer method “getSize()” which returns size of the stack. Define the method “peek()” which returns top element from the stack. Define the method “pop()” which returns stack elements. Define the method “push()” which inserts the values into stack. Define the method “search()” which searches the index position of the stack. Define the method “toString()” which prints the stack elements.

Question

Want to see the full answer?

Answer 1

Question

Chapter 19, Problem 19.2PE

Program Plan Intro

Implement “GenericStack” using inheritance

Program Plan:

Include appropriate package “import java.util.Scanner” into program.

Define the class named “Exercise19_02”.

Define main method.

Define the object “obj” for “GenericStack<String>” class.

Assign the object for “Scanner” class.

Prompt the user and get the strings from user and push the values into stack using “for” loop.

Using “for” loop, print array elements in reverse order.

Define the class “GenericStack<E>” which extends the “ArrayList<E>” class.

Define the Boolean method “isEmpty()” which returns empty value.

Define the Integer method “getSize()” which returns size of the stack.

Define the method “peek()” which returns top element from the stack.

Define the method “pop()” which returns stack elements.

Define the method “push()” which inserts the values into stack.

Define the method “search()” which searches the index position of the stack.

Define the method “toString()” which prints the stack elements.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Explain what the rs() function does. What value(s) does it return? Is that value always the same? Why or why not?

Explain what the rwsteps() function does. What is the base case? What values are passed to the recursive call? What is printed each time rwsteps() is called? What value is returned by the original function call?

module: java Question3: (30 MARKS) Passenger Rail Agency for South Africa Train Scheduling System Problem Statement Design and implement a train scheduling system for Prasa railway network. The system should handle the following functionalities: 1. Scheduling trains: Allow the addition of train schedules, ensuring that no two trains use the same platform at the same time at any station. 2. Dynamic updates: Enable adding new train schedules and canceling existing ones. 3. Real-time simulation: Use multithreading to simulate the operation of trains (e.g., arriving, departing). 4. Data management: Use ArrayList to manage train schedules and platform assignments. Requirements 1. Add Train Schedule, Cancel Scheduled Train, View Train Schedules and Platform Management 2. Concurrency Handling with Multithreading i.e Use threads to simulate train operations, Each…