Practice Heaps As A Sorting Algorithm (11.4) - Heaps and Dijkstra's Algorithm

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 type of heap has the maximum element at the root?
Show hintHide hint
Think about which is at the highest priority.
Question 2.
Describe what happens during the delete max operation.
Show hintHide hint
Consider how the structure needs to be maintained.
3Question 3.
What is the time complexity of heapsort?
- O(n)
- O(n log n)
- O(log n)
Show hintHide hint
Think about both building and extracting complexities.
4Question 4.
True or False: A min-heap ensures the maximum element is at the root.
- True
- False
Show hintHide hint
Remember the definitions of heap types!
Question 5.
Design an algorithm to construct a max-heap from an unsorted array of integers. Show intermediate steps.
Show hintHide hint
Consider each subtree and how to ensure the heap property is maintained.
Question 6.
Explain in detail how heapsort can be applied to sort an array of negative numbers.
Show hintHide hint
Remember that sorting depends on order, not value sign.

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