Implement the provided Stack interface ( fill out the implementation shell). Put your implementation through its paces by exercising each of the methods in a test harness. Add to your ‘StagBusClient’ the following functionality using your Stack. -Create (push) 6 riders by name. Iterate over the stack, print all riders -Peek at the stack / print the result. -Remove (pop) the top of the stack. Iterate over the stack, print all riders -Peek at the stack / print the result -Add two more riders to the stack -Peek at the stack & print the result -Remove all riders from the stack -Verify the stack is now empty ( print that result ) StagBusClient.java package app; import queue.Queue; import queue.QueueImpl; public class StagBusClient { public static void main(String[] args) { // create implementation, then   //QueueRunTestMethod... System.out.println("----Q U E U E T E S T-------"); //StackRunTestMethod...   } } Stack.java package stack;   public interface Stack {   public void push(String s); public String pop(); public Boolean isEmpty(); public Boolean isFull(); public int size(); public String peek();   public void setCapacity(int size); public void display(); } StackImpl.java package stack; public class StackImpl implements Stack { } StackTester.java package stack;   public class StackTester { public static void main(String[] args) {     }   public static void runTests(Stack 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
icon
Related questions
Question

Implement the provided Stack interface ( fill out the implementation shell). Put your implementation through its paces by exercising each of the methods in a test harness. Add to your ‘StagBusClient’ the following functionality using your Stack.

-Create (push) 6 riders by name. Iterate over the stack, print all riders

-Peek at the stack / print the result.

-Remove (pop) the top of the stack. Iterate over the stack, print all riders

-Peek at the stack / print the result

-Add two more riders to the stack

-Peek at the stack & print the result

-Remove all riders from the stack

-Verify the stack is now empty ( print that result )

StagBusClient.java

package app;

import queue.Queue;

import queue.QueueImpl;

public class StagBusClient {

public static void main(String[] args) {

// create implementation, then

 

//QueueRunTestMethod...

System.out.println("----Q U E U E T E S T-------");

//StackRunTestMethod...

 

}

}

Stack.java

package stack;

 

public interface Stack {

 

public void push(String s);

public String pop();

public Boolean isEmpty();

public Boolean isFull();

public int size();

public String peek();

 

public void setCapacity(int size);

public void display();

}

StackImpl.java

package stack;

public class StackImpl implements Stack {

}

StackTester.java

package stack;

 

public class StackTester {

public static void main(String[] args) {

 

 

}

 

public static void runTests(Stack stack) {

 

}

}

 

 

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Knowledge Booster
Stack
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
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education