Priority Queues1.6. Potential Future Improvements

Try these first

1. 1.

   What is a priority queue?

   Hint

   Think about how tasks are managed in an operating system.

2. 2.

   What is the time complexity for inserting a task in an unsorted list?

   Hint

   Consider how you would append an item to a list.

3. 3.

   What operation is performed to remove the highest priority item from a priority queue?

   • Insert
   • Delete min
   • Delete max

   Hint

   Remember the two primary operations of a priority queue.

4. 4.

   True or False: An unsorted list allows for faster retrieval of the maximum priority item compared to a sorted list.

   • True
   • False

   Hint

   Think about how the items in each list are organized.

5. 5.

   Construct a priority queue using a two-dimensional array, and perform a series of inserts and deletes. Provide a computational analysis of the operations.

   Hint

   Track operations clearly with comments in your code for analysis.

6. 6.

   Evaluate which priority queue structure (unsorted, sorted, or heap) would be optimal for a system processing 1000 jobs with varied priority levels. Justify your answer.

   Hint

   Consider not only time complexity but also real-world factors like memory overhead.