CS301 Solved Quiz 1 Set 2 by VUBuddy

WMIg3Q

CS301 QUIZ 1 SOLVED

Q1. For a perfect binary tree of height 4, what will be the sum of highest of node

1. 31
2. 30
3. 27
4. 26

Correct answer: 26

Q2. 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

1. Reflexivity
2. Symmetry
3. Transitivity
4. All of the above

Correct answer: Transitivity

Q3. Which one of the following is NOT the property of equivalence relation?

1. Reflexive
2. Symmetric
3. Transitive

WMIg3Q

d) Associative

Q4. The main reason of using heap in priority queue is

1. Improve performance
2. Code readable
3. Less code
4. Heap can’t be used in priority queues

Correct answer: Improve performance

Q5. The total number of nodes on 10th level of perfect binary tree are

1. 256
2. 512
3. 1024
4. Can’t be determined

Correct answer: 1024

Q6. Suppose there are 100 elements in an equivalence class, so initially there will be 100 trees, the collection of these trees is called

1. Cluster
2. Class
3. Forest
4. Bunch

Correct answer: Forest

WMIg3Q

7. The percolate Down procedure will move the smaller value and bigger value.

a) Left, right b) Right, left c) Down, up

d) Up, down

Q8. For a perfect binary tree of height h, having N nodes, the Sum of height of nodes is

1. N - h -1
2. N - 1
3. N - 1 + h
4. N - (h - 1)

Correct answer: N - h -1

Q10. Which of the following method is helpful in creating the heap at once?

1. Insert
2. Add
3. Update
4. percolateDown

Correct answer: percolateDown

Q11. If ahmad is boss of ehsan and ehsan is boss of umer then ahmad is also boss of umer, the above-mentioned relation is

1. Reflexive