(Solved Homework): Implement the interface listed below to create a stack class written in Java using an array. In addition, create a driver class th…

Java:

Help me with the following Array Based Stack lab please:

Don't use plagiarized sources. Get Your Custom Essay on
(Solved Homework): Implement the interface listed below to create a stack class written in Java using an array. In addition, create a driver class th…
Get an essay WRITTEN FOR YOU, Plagiarism free, and by an EXPERT!
Order Essay

Implement the interface listed below to create a stack class written in Java using an array. In addition, create a driver class that tests your stack class. The specification and implementation of our stack is different from the books implementation, but they are very similar. Recall that a stack is a linear collection where insertion and deletion occur at one end only. A stack is a last in, first out (LIFO) data structure. The last element to be put on the stack will be the first element that gets removed. Stacks can be applied to numerous programming problems such as the evaluation of arithmetic expressions An abstract data type (ADT) defines the operations that can be performed on the collection (data structure). Whenever you create a data structure, you should formally list and describe the operations that can be performed on it. That way, you can separate the interface to the collection from the implementation technique used to create it. Operation Description push pop peek Adds an element to the top of the stack. Removes an element from the top of the stack. Examines the element at the top of the stack. Returns true if the stack is em Returns true if the stack is full. Returns the number of elements in the stack. isEmpty isFull s1Ze public interface StackIntADT public void push(int element); public int pop0; public int peek0: public boolean isEmpty0; public boolean isFullO; public int size0;

Implement the interface listed below to create a stack class written in Java using an array. In addition, create a driver class that tests your stack class. The specification and implementation of our stack is different from the books implementation, but they are very similar. Recall that a stack is a linear collection where insertion and deletion occur at one end only. A stack is a last in, first out (LIFO) data structure. The last element to be put on the stack will be the first element that gets removed. Stacks can be applied to numerous programming problems such as the evaluation of arithmetic expressions An abstract data type (ADT) defines the operations that can be performed on the collection (data structure). Whenever you create a data structure, you should formally list and describe the operations that can be performed on it. That way, you can separate the interface to the collection from the implementation technique used to create it. Operation Description push pop peek Adds an element to the top of the stack. Removes an element from the top of the stack. Examines the element at the top of the stack. Returns true if the stack is em Returns true if the stack is full. Returns the number of elements in the stack. isEmpty isFull s1Ze public interface StackIntADT public void push(int element); public int pop0; public int peek0: public boolean isEmpty0; public boolean isFullO; public int size0;

Expert Answer

 

**StackIntAdt.java

public interface StackIntAdt

{

public void push(int element);

public int pop();

public int peek();

public boolean isEmpty();

public boolean isFull();

public int size();

}

**IntStack.java

public class IntStack implements StackIntAdt {

private int stackPointer;

private int size;

private int array[];

public IntStack() {

this.stackPointer = -1;

this.size = 10;

array = new int[size];

System.out.println(“Initialized the stack with default size of 10”);

// TODO Auto-generated constructor stub

}

public IntStack(int i) {

// TODO Auto-generated constructor stub

this.stackPointer = -1;

this.size = i;

array = new int[size];

System.out.println(“Initialized the stack with size of ” + this.size);

}

@Override

public void push(int element) {

// TODO Auto-generated method stub

if(!this.isFull()){

this.stackPointer++;

this.array[this.stackPointer] = element;

System.out.println(“Pushed the element ” + element + ” into the stack”);

}

else

System.out.println(“The stack is full”);

}

@Override

public int pop() {

// TODO Auto-generated method stub

if(!this.isEmpty()){

int poppedElement = this.array[this.stackPointer];

this.stackPointer–;

return poppedElement;

}

else{

return -1;

}

}

@Override

public int peek() {

// TODO Auto-generated method stub

return this.array[this.stackPointer];

}

@Override

public boolean isEmpty() {

// TODO Auto-generated method stub

if(this.stackPointer == 0)

return true;

else

return false;

}

@Override

public boolean isFull() {

// TODO Auto-generated method stub

if(this.stackPointer == this.size – 1)

return true;

else

return false;

}

@Override

public int size() {

// TODO Auto-generated method stub

return this.size;

}

}

**Driver.java

public class Driver {

public static void main(String args[]){

IntStack object1 = new IntStack();

boolean isEmpty = object1.isEmpty();

if(isEmpty)

System.out.println(“The stack is empty”);

else

System.out.println(“The stack is not empty”);

object1.push(5);

object1.push(1);

object1.push(9);

object1.push(55);

object1.push(4);

object1.push(97);

int peekElement = object1.peek();

System.out.println(“The peek element is ” + peekElement);

object1.push(22);

object1.push(23);

boolean isFull = object1.isFull();

if(isFull)

System.out.println(“The stack is full”);

else

System.out.println(“The stack is not full”);

object1.push(29);

object1.push(26);

int pop = object1.pop();

if(pop == -1)

System.out.println(“The stack is empty”);

else

System.out.println(“Popped element is ” + pop);

/*

* Scanner in = new Scanner(System.in);

* int userSize = in.nextInt();

* IntStack object2 = new IntStack(10);

* Now perform the push, pop operations

*/

}

}

**Screenshot of sample input and output:

Homework Ocean
Calculate your paper price
Pages (550 words)
Approximate price: -

Why Work with Us

Top Quality and Well-Researched Papers

We always make sure that writers follow all your instructions precisely. You can choose your academic level: high school, college/university or professional, and we will assign a writer who has a respective degree.

Professional and Experienced Academic Writers

We have a team of professional writers with experience in academic and business writing. Many are native speakers and able to perform any task for which you need help.

Free Unlimited Revisions

If you think we missed something, send your order for a free revision. You have 10 days to submit the order for review after you have received the final document. You can do this yourself after logging into your personal account or by contacting our support.

Prompt Delivery and 100% Money-Back-Guarantee

All papers are always delivered on time. In case we need more time to master your paper, we may contact you regarding the deadline extension. In case you cannot provide us with more time, a 100% refund is guaranteed.

Original & Confidential

We use several writing tools checks to ensure that all documents you receive are free from plagiarism. Our editors carefully review all quotations in the text. We also promise maximum confidentiality in all of our services.

24/7 Customer Support

Our support agents are available 24 hours a day 7 days a week and committed to providing you with the best customer experience. Get in touch whenever you need any assistance.

Try it now!

Calculate the price of your order

Total price:
$0.00

How it works?

Follow these simple steps to get your paper done

Place your order

Fill in the order form and provide all details of your assignment.

Proceed with the payment

Choose the payment system that suits you most.

Receive the final file

Once your paper is ready, we will email it to you.

Our Services

No need to work on your paper at night. Sleep tight, we will cover your back. We offer all kinds of writing services.

Essays

Essay Writing Service

No matter what kind of academic paper you need and how urgent you need it, you are welcome to choose your academic level and the type of your paper at an affordable price. We take care of all your paper needs and give a 24/7 customer care support system.

Admissions

Admission Essays & Business Writing Help

An admission essay is an essay or other written statement by a candidate, often a potential student enrolling in a college, university, or graduate school. You can be rest assurred that through our service we will write the best admission essay for you.

Reviews

Editing Support

Our academic writers and editors make the necessary changes to your paper so that it is polished. We also format your document by correctly quoting the sources and creating reference lists in the formats APA, Harvard, MLA, Chicago / Turabian.

Reviews

Revision Support

If you think your paper could be improved, you can request a review. In this case, your paper will be checked by the writer or assigned to an editor. You can use this option as many times as you see fit. This is free because we want you to be completely satisfied with the service offered.

See all services
× Contact Live Agents