In Project you created a queue that does not allow duplicates. In this project you will create a priority queue that does not allow duplicates. The function of the add operation should be analogous to the changed enqueue method in Project 5. In this case, the test for equals should not include the priority, so the header of the add method should be changed to the one given in the previous project. A new operation move will change the priority of a given item, if it is already in the priority queue. If the item is not in the priority queue, move will add it with the given priority.
Create an interface for a priority queue that does not allow duplicates. Then write a class that implements this interface. Finally, write a program that adequately demonstrates your new class.
Consider a new kind of queue that allows only a single copy of an object in the queue. If an object is added to the queue, but it is already there, leave the queue unchanged. This queue has another operation moveToBack that takes an object in the queue and moves it to the back. If an object is not in the queue, the operation adds it at the back of the queue. Create an interface NoDuplicatesQueueInterface that extends QueueInterface. Then write an array-based implementation of NoDuplicatesQueueInterface. Finally, write a program that adequately demonstrates your new class.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.