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

Please answer the following question in Python code: Inheritance (based on 8.38) You MUST use inheritance for this problem. A stack is a sequence container type that, like a queue, supports very restrictive access methods: all insertions and removals are from one end of the stack, typically referred to as the top of the stack. A stack is often referred to as a last-in first-out (LIFO) container because the last item inserted is the first removed. Implement a Stack class using Note that this means you may be able to inherit some of the methods below. Which ones? (Try not writing those and see if it works!) Constructor/_init__ - Can construct either an empty stack, or initialized with a list of items, the first item is at the bottom, the last is at the top. push() – take an item as input and push it on the top of the stack pop() – remove and return the item at the top of the stack isEmpty() – returns True if the stack is empty, False otherwise [] – return the item at a given…

(Please Help. My professor did not teach us any of this and will not answer my emails) Design a class named Queue for storing integers. Like a stack, a queue holds elements. In a stack, the elements are retreived in a last-in-first-out fashion. In a queue, the elements are retrieved in a first-in-first-out fashion. The class contains: An int[] data field named elements that stores the int values in the queue A data field named size that stores the number of elements in the queue A constructor that creates a Queue object with defult capacity 8 The method enqueue(int v) that adds v into the queue The method empty () that returns true if the queue is empty The method getSize() that returns the size of the queue

(Sort ArrayList) Write the following method that sorts an ArrayList: public static <E extends Comparable<E>> void sort(ArrayList<E> list) Write a test program that prompts the user to enter 10 integers, invokes this method to sort the numbers, and displays the numbers in increasing order. Sample Run Enter 10 integers: 3 4 12 7 3 4 5 6 4 7 The sorted numbers are 3 3 4 4 4 5 6 7 7 12 Class Name: Exercise19_09