Question: Write concrete classes that implement Java Interfaces according to specifications given in UML. Implement the functionality of a Stack data structure. You are not allowed
Write concrete classes that implement Java Interfaces according to specifications given in UML.
Implement the functionality of a Stack data structure.
You are not allowed to use any of the standard Java collection types (like ArrayList) for this assignment. Do not import any Java standard library features from java.util, except java.util.NoSuchElementException. You may use simple arrays. You may also use any code from your MyArrayList or MyLinkedList submissions.
Problem Description and Given Info
For this assignment you are given the following Java source code files:
IStack.java (This file is complete make no changes to this file)
MyStack.java (You must complete this file)
Main.java (You may use this file to write code to test your MyStack)
You must complete the public class named MyStack.java with fields and methods as defined below. Your MyStack.java will implement the IStack interface that is provided in the IStack.java file. You must implement your MyStack class as either a linked list or an array list (refer to your MyArrayList and MyLinkedList work). Your MyStack must not be arbitrarily limited to any fixed size at run-time.
UML
UML CLass Diagram: MyStack
Structure of the Fields
While there are no required fields for your MyStack class, you will need to decide what fields to implement. This decision will be largely based on your choice to implement this MyStack as either an array list or a linked list.
Structure of the Methods
As described by the UML Class Diagram above, your MyStack class must implement the following methods:
a public method named push that takes an Object argument and returns nothing
a public method named pop that takes no arguments and returns an Object
a public method named peek that takes no arguments and returns an Object
a public method named indexOf that takes an Object argument and returns an int
a public method named size that takes no arguments and returns an int
a public method named isEmpty that takes no arguments and returns an boolean
Note that:
these methods are declared in the IStack interface. You will be implementing these methods in this MyStack concrete class.
Additional Information
MyStack
This concrete class will store its elements in either an internal array list or linked list. All such implementation details must be contained in your myStack.java file. You may add any additional fields, methods, and inner classes that you will need to achieve this.
push method
Add a new item to top of the stack. For example: given the stack {1, 2, 3} (where the value 1 is on the top) and an instruction to push(99), the result would be this {99, 1, 2, 3}, with the value 99 now on the top of the stack.
pop method
Remove and return the item currently on the top of the stack. For example: given the stack {1, 2, 3} (where the value 1 is on the top) and an instruction to pop(), the stack would now look like this {2, 3}, and the value 1 would be returned.
Throws a NoSuchElementException if the stack is currently empty when this method is called.
peek method
Return (but do not remove) the item currently on the top of the stack. For example: given the stack {1, 2, 3} (where the value 1 is on the top) and an instruction to peek(), the stack would still look like this {1, 2, 3}, and the value 1 would be returned.
Throws a NoSuchElementException if the stack is currently empty when this method is called.
indexOf method
Return the (zero-based) number of elements from the front or top of the collection where the specified item is first found. Returns -1 if the item is not found in the collection. For example: given the stack {1, 2, 3} (where the value 1 is on the top) and the instruction indexOf(2), the value 1 would be returned (because the value 2 was found at index 1 (1 element below the top) in the stack. For another example: given the stack {1, 2, 3} (where the value 1 is on the top) and the instruction indexOf(99), the value -1 would be returned (because the value 99 is not found in the stack).
size method
Returns the number of elements currently stored in the stack.
isEmpty method
Returns true if there are currently no items stored in this stack, otherwise returns false.
This is what I got so far but getting issues with my overides
import java.util.ArrayList; import java.util.NoSuchElementException; abstract class MyStack implements IStack { MyArrayList
//Throws a NoSuchElementException if stack is currectly empty @Override public Object pop() { if(isEmpty())
throw new NoSuchElementException();
return this.list.remove(0);
// remove the first item from the list } //Return (but not remove) the item currently on top of the stack
//Throws a NoSuchElementException if stack is currectly empty
@Override public Object peek() { if(isEmpty()) throw new NoSuchElementException(); return this.list.get(0); // return the first item from the list } //Return the index where the specified item is first found
//Return -1 if the item is not found in the collection @Override public int indexOf(Object item) { return this.list.indexOf(item); // return the index of the item in the list } //returns the number of elements currently stored in the stack @Override public int getSize() { return this.list.size(); // return the size of the list } //Returns true if there are currently no items in this stack, otherwise returns false @Override public boolean isEmpty() { return getSize() == 0; // return true if the list is empty } }
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
Study Help