CS301 Quiz 3 2024 by VUBuddy

Q1. Consider a min heap, represented by the following array:

1. 3,4,6,7,5
2. After calling the function deleteMin().Which of the following is the updated min heap?
3. 4,6,5,7,
4. 6,7,5,4

Correct answer: 3,4,6,7,5

e. 4,5,6,7✺➳

©ARTIST©

f. 4,6,7,5

Q2. While building Huffman encoding tree the new node that is the result of joining two nodes has the frequency.

1. Equal to the small frequency
2. Equal to the sum of the two frequencies ✺➳

©ARTIST©

©ARTIST©©ARTIST©c. Equal to the greater frequency

d. Equal to the difference of the two frequencies

Q3. In Huffman encoding, codes are sent to the receiver in ___________ format.

1. Hexadecimal
2. Octal
3. Binary✺➳

©ARTIST©

d. ASCII

Q4. In double left-right rotation in the AVL tree, the single ____ rotation is carried at first, followed by single _____rotation.

1. left, right
2. left, left
3. right, left✺➳

©ARTIST©

d. d right, right

Q5. A binary tree with 45 internal nodes has _______links to external nodes.

1. 90
2. 44
3. 45✺➳

©ARTIST©

d. d . 46

Q6. In which of the following tree, parent node has key greater than or equal to its both children?

1. Threaded Binary tree
2. Complete Binary tree
3. Binary search tree
4. Max heap✺➳

©ARTIST©

Q7. Suppose we are building the AVL tree using nodes 13, 7 and 9 then which type of rotation at root node will balance the tree?

1. Double right-left
2. Single left
3. Double left-right
4. Single right✺➳

©ARTIST©

Q8. If there are 56 internal nodes in a binary tree then how many external nodes this binary tree will have?

1. 57✺➳

©ARTIST©

b. 54 c. 55 d. 56

Q9. The worst case of building a heap of N keys is _______ .

1. N
2. NLogn✺➳

©ARTIST©

c. N^2 d. 2^N 10.

Consider a max heap, represented by the following array:

a. 40,30,20,10,15,16,17,8,4 b. After inserting a node with value 35. Which of the following is the updated max heap? c. 40,35,20,10,30,16,17,8,4,15 d. 40,30,20,10,15,16,17,8,4,35✺➳

©ARTIST©

e. 40,35,20,10,15,16,17,8,4,30 f. 40,30,20,10,35,16,17,8,4,15

11.

Which of the following statement is correct?

1. A Threaded Binary Tree is a binary tree in which

THREAD (in actual sense, a link) to its POSTORDER