GATE CS 2015 Set 1 – Question 34

Multiple choice 2 marks Question 34 2015

Question 34

MCQ 2 marks · −0.66 Algorithms

Consider the following array of elements:

<89, 19, 50, 17, 12, 15, 2, 5, 7, 11, 6, 9, 100>

The minimum number of interchanges needed to convert it into a max-heap is

Answers and explanations are free — they just need an account.

Where this question comes from

GATE CS — Computer Science & IT 2015 Algorithms

Source: GATE 2015 Computer Science and Information Technology, Set 1, Q34 (set and question number approximate)

All Algorithms questions