Register

UGC NET CSE | August 2016 | Part 3 | Question: 34

• recategorized
2,564 views
1 votes
1 votes

A priority queue is implemented as a max-heap. Initially, it has five elements. The levelorder traversal of the heap is as follows :

20, 18, 15, 13, 12

Two new elements ‘10’ and ‘17’ are inserted in the heap in that order. The level-order traversal of the heap after the insertion of the element is :

  1. 20, 18, 17, 15, 13, 12, 10
  2. 20, 18, 17, 12, 13, 10, 15
  3. 20, 18, 17, 10, 12, 13, 15
  4. 20, 18, 17, 13, 12, 10, 15
• recategorized
User Avatar

1 Answer

0 votes
0 votes
Answer is D

The heap is
              20
    18               15

13     12        

On inserting 10 it becomes

                20

       18               15

 13       12       10

On inserting 15


               20

      18            17

13      12      10      15

Which is
20 18 17 13 12 10 15
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
makhdoom ghaya asked Oct 1, 2016
725 views
UGC NET CSE | August 2016 | Part 3 | Question: 35
If there are $n$ integers to sort, each integer has d digits, and each digit is in the set $\left\{1, 2, …, k\right\}$, radix sort can sort the numbers in : $O (k (n + d))$ $O (d (n + k))$ $O ((n + k) l g d)$ $O ((n + d) l g k)$
If there are $n$ integers to sort, each integer has d digits, and each digit is in the set $\left\{1, 2, …, k\right\}$, radix sort can sort the numbers in :$O (k (n + d...
User Avatar
1 votes
1 votes
4 answers
2
makhdoom ghaya asked Oct 1, 2016
1,819 views
UGC NET CSE | August 2016 | Part 3 | Question: 33
Consider a weighted complete graph $G$ on the vertex set $\left\{ν_{1} , ν_{2},.... ν_{n} \right\}$ such that the weight of the edge $(ν_{i} , ν_{j})$ is $4 | i – j|$. The weight of minimum cost spanning tree of $G$ is : $4n^{2}$ $n$ $4n – 4$ $2n – 2$
Consider a weighted complete graph $G$ on the vertex set $\left\{ν_{1} , ν_{2},.... ν_{n} \right\}$ such that the weight of the edge $(ν_{i} , ν_{j})$ is $4 | i – ...
User Avatar
1 votes
1 votes
1 answer
3
makhdoom ghaya asked Oct 1, 2016
866 views
UGC NET CSE | August 2016 | Part 3 | Question: 32
Consider a hash table of size $m = 10000$, and the hash function $h(K) = floor (m(KA \bmod 1))$ for $A = ( \sqrt{5} – 1)/2$. The key $123456$ is mapped to location ______. $46$ $41$ $43$ $48$
Consider a hash table of size $m = 10000$, and the hash function $h(K) = floor (m(KA \bmod 1))$ for $A = ( \sqrt{5} – 1)/2$. The key $123456$ is mapped to location ____...
User Avatar
0 votes
0 votes
2 answers
4
makhdoom ghaya asked Sep 15, 2016
5,893 views
UGC NET CSE | June 2010 | Part 2 | Question: 22
What is the most appropriate data structure to implement a priority queue ? Heap Circular array Linked list Binary tree
What is the most appropriate data structure to implement a priority queue ?HeapCircular arrayLinked listBinary tree
User Avatar
Link Copied!