Cs301P Paper Review MCQS were very easy mostly from handouts 1.Queues 2.Avl Tree rotations 3. Huffman coding introduced in 4.Inorder successor 5.Which is not elementary algorithm 6.Inorder traversal 7.Linear Probing in Hashing 8.running time case of Selection sort 9.how many iteration in binary search array given 10.find parent of node in array 11.which node in avl tree is unbalanced, tree given 12.union by height 13. Union by weight 14. Linear probing disadvantage 15. Which data structure contains next elements information 16. Postfix expression 17. Binary sort 18. Balance Avl tree Long Questions 1. Given a AVL tree add 2 more nodes in it and balance it. 2. Write Build Heap Code 3. Binary search algorithm code output 4. Implement getnext and setnext functions of Linked List