Practice Heaps (9) - Heaps - Design & Analysis of Algorithms

Practise this section

9 questions

Flashcard drill
3 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 the primary purpose of a priority queue?
Show hintHide hint
Think about how tasks are executed based on urgency.
Question 2.
What is a heap?
Show hintHide hint
Consider how heaps are structured compared to other trees.
3Question 3.
Which operation removes the highest priority element from a heap?
- Insert
- Delete Max
- Add Element
Show hintHide hint
Remember the operation that focuses on removing elements.
4Question 4.
True or False: The max heap property requires each parent to be less than its children.
- True
- False
Show hintHide hint
Think about how parents compare to their children in a binary tree.
Question 5.
Given the following values, insert them into an empty max heap: 10, 20, 15, 30, 5. Show the steps taken.
Show hintHide hint
Keep track of the parent comparisons during each insertion.
Question 6.
Construct a min heap from the following elements: 5, 3, 17, 10, 84, 19, 6, 22, 9. Show how to maintain the min heap property.
Show hintHide hint
Remember, each insertion can cause a bubble down to find the correct position.

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