Priority Queues1. Priority Queues

Try these first

1. 1.

   What operation removes the job with the highest priority from a priority queue?

   Hint

   Think about extracting the most important task.

2. 2.

   Which data structure would allow us to easily add new jobs?

   Hint

   Consider the time needed for adding elements.

3. 3.

   What is the primary operation of a priority queue?

   • Insert
   • Delete Min
   • Delete Max
   • Sort

   Hint

   Think about how we prioritize tasks.

4. 4.

   True or False: A priority queue can only use sorted structures to be effective.

   • True
   • False

   Hint

   Consider different approaches to data structure design.

5. 5.

   Given a set of jobs with different priorities, if inserted into a priority queue using an unsorted list, what would be the time complexity for processing 100 jobs?

   Hint

   Consider the implications of each operation's time complexity.

6. 6.

   If an algorithm making use of heaps processes 500 jobs, how could the overall running time be improved?

   Hint

   Consider the operations in log time for effective processing.