# CS301 Data Structures Quiz 2 Jan 16 -17 2013

Question # 1 of 10
If we want to find median of 50 elements, then after applying buildHeap method, how many times deleteMin method will be called ?
Select correct option:
5

• 25

35
50
Question # 2 of 10
If Ahmed is cousin of Ali and Ali is cousin of Asad then Ahmed is also cousin of Asad. This statement has the following property
Select correct option:
Reflexivity
Symmetry

• Transitivity

All of the above

Question # 3 of 10
If we want to find 3rd minimum element from an array of elements, then after applying buildHeap method, how many times deleteMin method will be called ?
Select correct option:
1
2

• 3

4

Question # 4 of 10
The preculateDown procedure will move the smaller value__ and bigger value____.
Select correct option:
left,right
right,left
up,down

• down,up

Question # 5 of 10
If the height of a perfect binary tree is 4. What will be the total number of nodes in it?
Select correct option:

• 15

16
31
32

Question # 6 of 10
The worst case of building a heap of N keys is _____ .
Select correct option:
N
N^2

• NlogN

2^N

Question # 7 of 10
Which of the following method is helpful in creating the heap at once?
Select correct option:

• insert

update
preculateDown

Question # 8 of 10
Consider a min heap, represented by the following array: 11,22,33,44,55 After inserting a node with value 66.Which of the following is the updated min heap?
Select correct option:

• 11,22,33,44,55,66

11,22,33,44,66,55
11,22,33,66,44,55
11,22,66,33,44,55

Question # 9 of 10
Which of the following heap method lowers the value of key at position ‘p’ by the amount ‘delta’?
Select correct option:
increaseKey(p,delta)

• decreaseKey(p,delta)

preculateDown(p,delta)
remove(p,delta)

Question # 10 of 10
Consider a min heap, represented by the following array: 3,4,6,7,5 After calling the function deleteMin().Which of the following is the updated min heap?
Select correct option:
4,6,7,5

• 6,7,5,4

4,5,6,7
4,6,5,7,