Problem 7 Below is a list of data structures and one application. Select two dat
ID: 642067 • Letter: P
Question
Problem 7
Below is a list of data structures and one application. Select two data structures that you think would be the most useful for the particular application. Of the two data structures that you selected, pick the better of the two and explain why it is better for that particular application. State all relevant assumptions.
Robot Requests: You have a robot that receives job requests from the Internet. These requests need to be processed based on their priority. The most urgent job needs to be executed first and then deleted. Choose a data structure to organize these jobs, support job insertion, the most urgent job extraction and deletion.
Explanation / Answer
I will select 2 data strcutues 1. Priority queue 2 .Queue
The advantage of a priority queue is that nodes can be weighted, allowing those with greater precedence to be moved towards the head of the queue, in front of those with lesser priority, rather than always being added to the tail of the queue as would happen in a normal queue.