Priority Queues1.3. Structure Choices for Implementing Priority Queues

Try these first

1. 1.

   What are the two primary operations of a priority queue?

   Hint

   Think about the operations needed to manage tasks with priorities.

2. 2.

   What is the time complexity of inserting an element in an unsorted list?

   Hint

   Consider how easy it is to add to a list without checking the order.

3. 3.

   What is the primary function of a priority queue?

   • To store elements in order
   • To retrieve high-priority tasks
   • To delete all tasks at once

   Hint

   Consider what role a priority queue plays in scheduling.

4. 4.

   True or False: An unsorted list allows for quick retrieval of the maximum priority job.

   • True
   • False

   Hint

   Think about the structure of the list.

5. 5.

   Given a series of jobs with varying priorities, describe how you would structure these using a priority queue to ensure optimal processing in a job scheduling example.

   Hint

   Consider the organization of your data for balancing insertions versus deletions.

6. 6.

   Design a priority queue that can handle dynamic updates where new job priorities can exceed existing maximums without resorting to linear searches.

   Hint

   Think about how a binary tree can help you keep elements balanced.