Create an implementation of each LinkedList, Queue Stack interface provided For each implementation create a tester to verify the implementation of that data structure performs as expected Your task is to: Implement the LinkedList interface ( fill out the implementation shell). Put your implementation through its paces by exercising each of the methods in the test harness Create a client ( a class with a main ) ‘StagBusClient’ which builds a bus route by performing the following operations on your linked list: Create (insert) 4 stations List the stations Check if a station is in the list (print result) Check for a station that exists, and one that doesn’t Remove a station List the stations Add a station before another station. List the stations Add a station after another station. Print the stations StagBusClient.java package app; import linkedList.LinkedList; import linkedList.LinkedListImpl; public class StagBusClient { public static void main(String[] args) { // create implementation, then System.out.println("-----L I S T T E S T------"); } } LinkedList.java package linkedList; public interface LinkedList { public Boolean isItemInList(String thisItem); // true if it is, false if not public Boolean addItem(String thisItem); // true if added, false if it was already there, or an error public Integer itemCount(); public void listItems(); public Boolean deleteItem(String thisItem); // true if deleted, false if not there or error public Boolean insertBefore(String newItem, String itemToInsertBefore); public Boolean insertAfter(String newItem, String itemToInsertAfter); //ExtraCredit public void sort(); // ascending alphanumeric sort; nothing fancy but ALTERS THE LIST, DOES NOT COPY. } // Implement this interface using class ListItem // Also implement the tester in this package. LinkedListImpl.java package linkedList; public class LinkedListImpl implements LinkedList { } LinkedListTestHarness.java package linkedList; public class LinkedListTestHarness { public static void main(String[] args) { // create implementation, then... } } ListItem.java package linkedList; public class ListItem { public String data; public ListItem next; public ListItem(String data) { this.data = data; this.next = null; } }

Create an implementation of each LinkedList, Queue Stack interface provided For each implementation create a tester to verify the implementation of that data structure performs as expected Your task is to: Implement the LinkedList interface ( fill out the implementation shell). Put your implementation through its paces by exercising each of the methods in the test harness Create a client ( a class with a main ) ‘StagBusClient’ which builds a bus route by performing the following operations on your linked list: Create (insert) 4 stations List the stations Check if a station is in the list (print result) Check for a station that exists, and one that doesn’t Remove a station List the stations Add a station before another station. List the stations Add a station after another station. Print the stations StagBusClient.java package app; import linkedList.LinkedList; import linkedList.LinkedListImpl; public class StagBusClient { public static void main(String[] args) { // create implementation, then System.out.println("-----L I S T T E S T------"); } } LinkedList.java package linkedList; public interface LinkedList { public Boolean isItemInList(String thisItem); // true if it is, false if not public Boolean addItem(String thisItem); // true if added, false if it was already there, or an error public Integer itemCount(); public void listItems(); public Boolean deleteItem(String thisItem); // true if deleted, false if not there or error public Boolean insertBefore(String newItem, String itemToInsertBefore); public Boolean insertAfter(String newItem, String itemToInsertAfter); //ExtraCredit public void sort(); // ascending alphanumeric sort; nothing fancy but ALTERS THE LIST, DOES NOT COPY. } // Implement this interface using class ListItem // Also implement the tester in this package. LinkedListImpl.java package linkedList; public class LinkedListImpl implements LinkedList { } LinkedListTestHarness.java package linkedList; public class LinkedListTestHarness { public static void main(String[] args) { // create implementation, then... } } ListItem.java package linkedList; public class ListItem { public String data; public ListItem next; public ListItem(String data) { this.data = data; this.next = null; } }

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

Create an implementation of each LinkedList, Queue Stack interface provided

For each implementation create a tester to verify the implementation of that
data structure performs as expected

Your task is to:

Implement the LinkedList interface ( fill out the implementation shell). Put your implementation through its paces by exercising each of the methods in the test harness

Create a client ( a class with a main ) ‘StagBusClient’ which builds a bus route by performing the following operations on your linked list:

Create (insert) 4 stations
List the stations
Check if a station is in the list (print result)
Check for a station that exists, and one that doesn’t
Remove a station
List the stations
Add a station before another station. List the stations
Add a station after another station. Print the stations

StagBusClient.java

package app;

import linkedList.LinkedList;

import linkedList.LinkedListImpl;

public class StagBusClient {

public static void main(String[] args) {

// create implementation, then

System.out.println("-----L I S T T E S T------");

}

LinkedList.java

package linkedList;

public interface LinkedList {

public Boolean isItemInList(String thisItem);

// true if it is, false if not

public Boolean addItem(String thisItem);

// true if added, false if it was already there, or an error

public Integer itemCount();

public void listItems();

public Boolean deleteItem(String thisItem);

// true if deleted, false if not there or error

public Boolean insertBefore(String newItem, String itemToInsertBefore);

public Boolean insertAfter(String newItem, String itemToInsertAfter);

//ExtraCredit

public void sort();

// ascending alphanumeric sort; nothing fancy but ALTERS THE LIST, DOES NOT COPY.

}

// Implement this interface using class ListItem

// Also implement the tester in this package.

LinkedListImpl.java

package linkedList;

public class LinkedListImpl implements LinkedList {

}

LinkedListTestHarness.java

package linkedList;

public class LinkedListTestHarness {

public static void main(String[] args) {

// create implementation, then...

}

ListItem.java

package linkedList;

public class ListItem {

public String data;

public ListItem next;

public ListItem(String data) {

this.data = data;

this.next = null;

}

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 4 steps

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.