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

solve this questions for me .

a) first player is the minimizing player. What move should be chosen?b) What nodes would not need to be examined using the alpha-beta pruning procedure?

Consider the problem of finding a path in the grid shown below from the position S to theposition G. The agent can move on the grid horizontally and vertically, one square at atime (each step has a cost of one). No step may be made into a forbidden crossed area. Inthe case of ties, break it using up, left, right, and down.(a) Draw the search tree in a greedy search. Manhattan distance should be used as theheuristic function. That is, h(n) for any node n is the Manhattan distance from nto G. The Manhattan distance between two points is the distance in the x-directionplus the distance in the y-direction. It corresponds to the distance traveled along citystreets arranged in a grid. For example, the Manhattan distance between G and S is4. What is the path that is found by the greedy search?(b) Draw the search tree in an A∗search. Manhattan distance should be used as the