Create a generic PriorityQueue class, which stores its QueueItem items in a private lis

INSTRUCTIONS TO CANDIDATES

ANSWER ALL QUESTIONS

Create a generic PriorityQueue class, which stores its QueueItem items in a private list. The PriorityQueue has two methods: Add and Next.

The Add method adds a QueueItem to the end of its private list. 

The Next method returns with the value of the highest priority item from the start of the list. It removes the returned item from the list. If it finds an item with a 0 priority, it removes the item, and jumps to the next one. If there are no more items in the list, it returns with a null value.

The PriorityQueue class can be iterated through with foreach. In this case, it does not remove its returned elements. The foreach loop returns items in the same order as the Next method, jumping through 0 priority items, but not removing them (e.g. [A(0), B(1), C(2), D(0), E(1)] -> C, B, E). Unlike the Next method, a foreach returns QueueItems, not their stored values.

 The QueueItem stores a generic value and an integer priority.

Test cases:

1. Create a string and an int type PriorityQueue class. Add an item to both of the classes. Check if the class works as generic.
2. Create a PriorityQueue class. Add 3 items to it, with priorities 1, 0, and 2. Check if the return order of the items is correct by calling the Next method. Check if the class is empty after it returned its last item.
3. Create a PriorityQueue class. Add 5 items to it with different values and different priorities. 2 of the 5 items must have 0 priority. Using a foreach loop, check if the order of the returned elements are correct. After the iteration, check if the class still has the elements.

 

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

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. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

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

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

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

. 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 Sea Ports. Here are the classes and their instance variables we wish to define:

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