THIS IN JAVA One benefits of having our data structures be generalized to hold any type of data is that we can have data structures store instances of data structures. As we mentioned in class, a priority queue is a queue where entries are added (enqueued) according to their priority level (and in order when priority is tied). So the entry with the highest priority that was added to the priority queue the earliest would be at the front and would be the entry that is removed (dequeued). Given that entries with the same priority will have to be organized in the order they were enqueued (first-in, first out), one possible option is to create a PriorityQueue that holds Queue objects. At the top level, the PriorityQueue can organize entries according to priority level and ensure that the separate priority groups are maintained in their proper order. At the next level, each component Queue would be responsible for all of the entries with the same priority level, and can maintain them in the order in which they were enqueued. For this problem, assume that there are only 5 priority levels (1 = very low; 2 = low; 3 = medium; 4 = high; 5 = very high). Give a detailed description of how you could implement the PriorityQueue as described above. Your answer should include: · How the top-level organization would work. · What properties your class would need. · A short description of how each of the three main queue operations (enqueue, dequeue, and getFront) would work.
THIS IN JAVA
One benefits of having our data structures be generalized to hold any type of data is that we can have data structures store instances of data structures. As we mentioned in class, a priority queue is a queue where entries are added (enqueued) according to their priority level (and in order when priority is tied). So the entry with the highest priority that was added to the priority queue the earliest would be at the front and would be the entry that is removed (dequeued).
Given that entries with the same priority will have to be organized in the order they were enqueued (first-in, first out), one possible option is to create a PriorityQueue that holds Queue objects. At the top level, the PriorityQueue can organize entries according to priority level and ensure that the separate priority groups are maintained in their proper order. At the next level, each component Queue would be responsible for all of the entries with the same priority level, and can maintain them in the order in which they were enqueued.
For this problem, assume that there are only 5 priority levels (1 = very low; 2 = low;
3 = medium; 4 = high; 5 = very high). Give a detailed description of how you could implement the PriorityQueue as described above. Your answer should include:
- · How the top-level organization would work.
- · What properties your class would need.
· A short description of how each of the three main queue operations (enqueue, dequeue, and getFront) would work.
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
