Linked List Queue
A queue is an ADT that represents an ordered, First-In-First-Out (FIFO) collection.
An ordered collection maintains the insertion order of the
New elements can only be added to the back of the
Existing elements can only be removed from the front of the
A queue can be used in real-world modeling, such as keeping track of service requests so that they are handled in the order they arrived. It can also be used internally in computer functions, such as storing printer requests in a print queue.
The basic methods for a queue are as follows:
enqueue(value) – adds the value to the back of the
dequeue() – removes the next available value from the front of the queue and reports the
isEmpty() – reports if the queue is empty. Other convenience methods are usually added:
front() – returns the value at the front of the queue without removing
size() – returns the number of values currently stored in the
Java’s LinkedList and ArrayDeque concrete classes implement the queue ADT, but they also include many other methods that do not prevent the access to data that should not be accessible in a pure queue implementation.
In Lab 2 your task is to create your own generic Queue class using a LinkedList as the underlying data type (a composition relationship.) This type of relationship allows you to hide LinkedList methods that are not applicable to a queue.
In the Project 2 module you are given a NetBeans project that contains the following classes:
An interface named PureQueue that defines the ADT described
A data-management class called Queue that implements the PureQueue interface. (This class is currently mostly )
A JUnit test class that tests the Queue class. (Found under TestPackages/cs143.)
Your job is to complete the Queue class. The following requirements and limitations apply:
You must use a Java LinkedList as your underlying data
You must make the Queue class generic so that it accepts any type of
You may not alter the JUnit test code in any
You must add method comments to the concrete class methods even if they override PureQueue methods that have method
Note that the method implementations are very simple. The hardest part will be studying the LinkedList methods and determining the best ones to call to fit the needs of the given Queue methods.
For the first week, you must work on this lab individually. Get it working the best you can. Use the test class to help you determine if you have succeeded. Do not alter any of the code that has been provided for you or add any other fields or methods. Just complete TODO sections with the correct code.
Bring your code to class the first day of the second week. You will then be assigned a group, and that group will have a Google Sheets document to share. Post your code in the correct cell for each of the methods listed in the column with your name at the top. Then meet with your group and compare solutions. Choose the best solution or create a new solution out of a combination of your code. Place the code in the “final version” column.
Now open a clean version of the NetBeans project, and copy and paste the final code solutions into the proper methods. Go back and review the requirements and limitations of this lab. Run the JUnit test and debug as necessary. Clean up indentation and spacing, and make sure you have named variables using proper Java naming conventions. When you are satisfied with your work, zip up the NetBeans project and submit it to the Lab 2 assignment. Do not edit or delete your Google Sheets work, as this will be used for part of your grade.
Your last job is to rank the members of your group. This is done individually. Find the Lab 2 Ranking survey and follow the instructions to rank how knowledgeable and helpful each group member was during this lab. This ranking will not impact anyone’s grade. It will only be used to help determine the makeup of future groups.
DescriptionIn this final assignment, the students will demonstrate their ability to apply two majorconstructs of the C programming language – Fu
Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t
Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th
1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of
1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of