CS301 Final Term Sample Paper Fall 2022

Sample Paper

FINALTERM EXAMINATION

Fall 2022 CS301 - Data Structures

Time: 90 min Marks: 60

Q1. AVL Tree is invented in the year ____________.

1. 1960
2. 1961
3. 1962
4. 1963

Q2. Inserting a node at the right most place would make root’s balance factor ____________.

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

Q3. As compared to BST, the root node in AVL tree is ___________.

1. 0
2. Null
3. Constant
4. Changeable

Q4. In AVL Tree, _______________ traversal gives sorted sequence in ascending order.

1. Inorder
2. Pre-order
3. Post-order
4. Level order Traversal

Q5. _______________ converts assembly language code into machine code i.e. 0s & 1s.

1. Interpreter
2. Compiler
3. Converter
4. Assembler

Q6. After deleting node 15 from above tree, how many rotations do we need to balance the AVL tree?

1. One Single Rotation
2. One Double Rotation
3. No Rotation
4. Two Single Rotations

Q7. Compiler converts the C++ code into ________________.

1. Assembly language
2. Visual Basic
3. Java
4. Bytecode

Q8. Which one of the following is the application of an Expression Tree?

1. MS Word
2. 2D Paint
3. Spreadsheets
4. Outlook

Q9. What is the height balancing factor in AVL tree?

1. Difference between left and right subtree heights
2. Sum of left and right subtree heights
3. Product of left and right subtree heights
4. Log of left and right subtree heights

Q10. The technique of using binary trees in data compression is referred to as ________.

1. Huffman encoding
2. Heap
3. Graph
4. BST