Answered: In Java please create a generic stack…

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

See similar textbooks

Related questions

Concept explainers

Question

In Java please

create a generic stack code and implement these methods

peek() returns a reference to the item at the top of the stack without removing it from the stack

contains(T t) is a boolean method that returns true if the stack contains t, the parameter, otherwise returns false. The stack contains t if at least one T on the stack is equal to t using the equals() method. Note that there is always an available equals() method in Java, because Object, the common parent of all classes, contains one. Implement this method without using the contains()method of the list.

Expert Solution

Step 1: Algorithm of the program:

Algorithm:

Create a generic GenericStack class with a private LinkedList to store elements.
Implement push(T item) to add elements to the stack.
Implement pop() to remove and return the top element from the stack.
Implement peek() to return the top element without removing it.
Implement contains(T item) to check if the stack contains a given element using the equals() method.
In the Main class:
Create an instance of GenericStack for strings.
Push elements onto the stack.
Use contains(T t) to check if the stack contains a specific element.
Use peek() to retrieve the top element of the stack.
Output the results.

Step by step

Solved in 4 steps with 3 images

SEE SOLUTION Check out a sample Q&A here

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.

Similar questions