CS301 Current FinalTerm Paper 22 August 2016

1. How one can find the height of a binary tree? (2 marks)
2. Name any two of "divide and conquer" algorithms. (2 marks)
3. Why do we use Huffman encoding? (2 marks)
4. How does heap sort work? (2 marks)
5. Explain the working of Heap sort. (3 marks)
6. A function defined with const was given. Output was required. (3 marks)
7. Insertion sort is used for small lists and quick sort is used for large lists. Why? (3 marks)
8. Heap tree was given to find either it's Max or Min. The tree data was required to write as an array as well. (3 marks)
9. Define Collision, Linear Probing, Quadratic Probing. (5 marks)
10. Data was given to make an AVL Tree. (5 marks)
11. Sets were given to make Union Tree using weight rule. (5 marks)
12. Expression tree was given to write Infix expression with parenthesis. (5 marks)