CS301 Final Term Solved MCQs by VU Malik

1. If there are 100 elements in a heap and 100 delete Min operation are performed, will get list a. Sorted b. Unsorted c. Nonlinear d. Noe
2. Sorting procedure normally takes times a) NLogN b) 2N c) N*N*N d) N
3. The expression if(!heap-> is empty ()) Checks a) Heap is empty b) Heap is full c) Heap is not empty

Q4. If the height of a perfect binary tree is 4.What will be the total number of nodes in it?

1. 15
2. 16
3. 31
4. 32

Q5. A binary relation R over S is called an equivalence relation if it has following property(S)?

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

Q6. If a tree has 20 edges/links, then the total number of nodes in the tree will be:

1. 19
2. 20
3. 21
4. Cannot be determined

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

Q8. 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
5. Which property of equivalence relation is satisfied if we say: Ahmad is cousin of Ali and Ali is also cousin of Ahmed

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

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

1. Reflexive
2. Symmetric
3. Transitive
4. Associative

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

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

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

Q13. 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
5. The percolate Down procedure will move the smaller value and bigger value _

1. Left, right
2. Right, left
3. Down, up
4. Up, down

Q15. 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)

Q16. Which of the following method is helpful in creating the heap at on

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

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

1. Reflexive
2. Symmetry
3. Transitive
4. None of given

Q18. If we want to find 3rd minimum element from an array of element, then after applying build heap method. How many times deleteMin method will be called?

e. 1 f. 2 g. 3 h. 4

If we want to find median of 50 elements, then after applying builtHeap method, how many time deleteMin method will be called?

i. 5 j. 25 k. 35 l. 50

20 Which of the following properties are satisfied by equivalence relationship? m. Reflexive, symmetric n. Reflexive, transitive o. Symmetric, transitive p. Reflexive, symmetric and transitive

21. The Expressionif ( ! heap->isFull() ) Check q. Heap is empty r. Heap is full s. Heap is not empty t. Heap is not full