CS301P Final Term 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. Which node will become unbalanced if a node is inserted as a child of the node R in the given tree?

1. L
2. P
3. R
4. M

Correct option: C. R

Q2. The ASCII value for character 'A' is:

1. 87
2. 68
3. 65
4. 66

Correct option: C. 65

Q3. A hole is created which needs to be filled if the element is __________ from the heap.

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

Correct option: C. Deleted

Q4. If the tree becomes unbalanced after deleting a node, then we use ____________ to rebalance it.

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

Correct option: A. Rotations

Q5. 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:

1. Max Heap