Practice Naive Two-dimensional Structure For Priority Queues (Priority Queues1.4) - Priority Queues

Practice: Naive Two-Dimensional Structure for Priority Queues

Lesson Priority Queues1.4Priority Queues

Practise this section

9 questions

Flashcard drill
2 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
3 questions · about 2 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What is a priority queue?
Show hintHide hint
Think about how tasks are sorted in importance.
Question 2.
What two operations do we perform on a priority queue?
Show hintHide hint
Consider what happens when a new job arrives.
3Question 3.
What is the time complexity for inserting a job into an unsorted list?
- O(1)
- O(N)
- O(log N)
Show hintHide hint
Think about how we add jobs.
4Question 4.
True or False: In a sorted list, the maximum element is always at the beginning.
- True
- False
Show hintHide hint
Consider how elements are ordered.
Question 5.
Given a priority queue with the following tasks and their priorities: (A, 3), (B, 5), (C, 2). Insert them into a two-dimensional structure. Then, delete the max and show the state of the structure.
Show hintHide hint
Remember how to determine the correct row and position for each insertion.
Question 6.
Critically analyze the efficiency of your two-dimensional structure for 100 jobs, state the impacts of the algorithmic complexity on performance and how it compares with heaps.
Show hintHide hint
Think about the trade-offs in performance and the practical applications of each structure.

5 more questions in this section. Enroll free to practise them all.