Complete ArrayStack.java, an array-based implementation o the Stack.java interface.Modify only the bodies of the following methods in the ArrayStack class:pushpoptopisEmptyisFullNothing else should be modified in ArrayStack.Write the class ArrayStackTest to test your implementation. Print only the names of the tests and error messages. Give the test method meaningful names (e.g., emptyStackTest).Test push, pop, top, and isEmpty immediately after the stack has been instantiated.Push an element on an empty stack. Test pop, top, and isEmpty.Instantiate a stack with initialCapacity of 1. Push two elements. Check capacity.Other tests you deem necessary. ArrayStack.javaimport java.util. EmptyStackException;public class ArrayStack implements Stack {private final static int DEFAULT_CAPACITY = 100;private final static int EMPTY_INDEX = -1;private Ell stack;private int top = EMPTY_INDEX; // Index of the top element on the stackpublic ArrayStack() {this (DEFAULT_CAPACITY);public Arraystack(int initialCapacity) {}initialCapacity = initialCapacity < @ ? @ : initialCapacity;stack (E[]) new Object[initialCapacityl;@Overridepublic void push(E element) {// TBD as part of an assignment@Overridepublic E pop() {

In this question, it is asked to provide the java code for the array implementation of a stack. The…

Answered: Complete ArrayStack.java, an…

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

Question

Complete ArrayStack.java, an array-based implementation o the Stack.java interface.

Modify only the bodies of the following methods in the ArrayStack class:

push
pop
top
isEmpty
isFull

Nothing else should be modified in ArrayStack.

Write the class ArrayStackTest to test your implementation. Print only the names of the tests and error messages. Give the test method meaningful names (e.g., emptyStackTest).

Test push, pop, top, and isEmpty immediately after the stack has been instantiated.
Push an element on an empty stack. Test pop, top, and isEmpty.
Instantiate a stack with initialCapacity of 1. Push two elements. Check capacity.
Other tests you deem necessary.

ArrayStack.java
import java.util. EmptyStackException;
public class ArrayStack<E> implements Stack<E> {
private final static int DEFAULT_CAPACITY = 100;
private final static int EMPTY_INDEX = -1;
private Ell stack;
private int top = EMPTY_INDEX; // Index of the top element on the stack
public ArrayStack() {
this (DEFAULT_CAPACITY);
public Arraystack(int initialCapacity) {
}
initialCapacity = initialCapacity < @ ? @ : initialCapacity;
stack (E[]) new Object[initialCapacityl;
@Override
public void push(E element) {
// TBD as part of an assignment
@Override
public E pop() {

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 3 steps with 1 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