CS301P Final Term Graded 3 Quiz 8 July 2023 by Miss Mehwish

We also provide Past papers for Mids. and Finals

Cross Check your answers before submitting directly from the file. We are not responsible for 100% correction as human error exists

Q1. A binary tree will not be considered an AVL tree if the difference between the left and right subtree of each node is not more than:

1. 0
2. 1
3. 2
4. 3

Correct option: c) 2

Q2. Consider the max heap represented by the following array. Which of the following is the parent of node 14?

Array: 20, 30, 40, 50 a) 20 b) 30 c) 40 d) 50

Correct option: b) 30

Q3. If the tree becomes unbalanced after deleting a node, then we use _________ to rebalance it. Options:

1. Rotations
2. Stack
3. Heap
4. Insertions

Correct option: a) Rotations

Q4. What is the encoding of the character 'C' in the given Huffman encoding tree? Huffman encoding tree: A4, B5, C3, D2, Ebd

1. 00
2. 10
3. 01
4. 11

Correct option: c) 01

Q5. How many rotations will be made if a node is inserted as the left child of the node R in the given tree? Tree: R, P, L(Mid), M, I (right)

1. 1
2. 2
3. 3
4. 4

Correct option: c) 3

Q6. A complete binary tree with a property that the value at each node is at least as small as the values in its children is called as _______.

1. Binary search tree
2. Binary tree
3. Min Heap
4. Max Heap

Correct option: c) Min Heap

Q7. A hole is created which needs to be filled if the element is _________ from the heap. Options:

1. Updated
2. There is no concept of hole in heap
3. Deleted
4. Inserted

Correct option: c) Deleted

Q8. Which of the following bit streams represents the string 'cab' in the given Huffman tree? Bit streams: a0, d0, f0, c1, r0, b1

1. 1011
2. 0101
3. 1100
4. 0011

Correct option: a) 1011