CS301 Final Term MCQs by VU Topper RM

Q1. Vu-Topper RM (1 marks)

A pair of sets which does not have any ________ element are called disjoint sets

Common

Q2. Vu-Topper RM (1 marks)

Which of the following is NOT true regarding the maze generation?

Remove a randomly chosen wall if the cells it separates are already in the same set. Page 424

Q3. Vu-Topper RM (1 marks)

A table consists of several columns, known as

Fields

Q4. Vu-Topper RM (1 marks)

The scenario “If Ali is brother of Asif and Asif is brother of Uzma then Ali is brother of Uzma” is the example of ___________ property.

Transitive

Q5. Vu-Topper RM (1 marks)

What is the time complexity of binary search with iteration?

O(logn)

Q6. Vu-Topper RM (1 marks)

Which of the following heap method lowers the value of key at position ‘p’ by the amount ‘delta’?

increaseKey(p,delta)

Q7. Vu-Topper RM (1 marks)

Suppose there are a set of fruits and a set of vegetables. Both sets are ______________ sets.

Disjoint

Q8. Vu-Topper RM (1 marks)

The expressionif ( ! heap->isFull() )check

Heap is not full

Q9. Vu-Topper RM (1 marks)

In min heap, if there are 100 elements in a heap and we perform 100 deleteMin operations then we will get the elements in _________.

Ascending order

Q10. Vu-Topper RM (1 marks)

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

Q11. Vu-Topper RM (1 marks)

There are 100 elements in a heap, if we perform 100 deleteMin operations then we will get ___________ list

Sorted

Q12. Vu-Topper RM (1 marks)

Which of the following is NOT an implementation of Table ADT?

Skip List

Q13. Vu-Topper RM (1 marks)

For a perfect binary tree of height 4. What will be the sum of heights of nodes?

Q14. Vu-Topper RM (1 marks)

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

Q15. Vu-Topper RM (1 marks)

Which of the following properties are satisfied by Equivalence relationship?

Reflexive , Symmetric and Transitive

Q16. Vu-Topper RM (1 marks)

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

Forest

Q17. Vu-Topper RM (1 marks)

For a perfect binary tree of height h, having N nodes, the sum of heights of nodes is _____________.

N-(H+1)

Q18. Vu-Topper RM (1 marks)

Heap can be used to implement