Q1. Describe the concept of asymptotic notations, pointing the normally used notations.
Q2. How do you declare an array of the structures? Describe with illustration.
Q3. Convert the given postfix expression to its corresponding infix and prefix expression.
Q4. List out any two applications of the linked list and two merits of doubly linked lists over singly linked list.
Q5. prepare down the results after traversing the tree in in-order, pre-order and post-order.
Q6. Describe the impact of threaded binary tree on the tree traversal process.
Q7. Obtain the optimal Huffman codes for the messages (M1… M7) with relative frequencies (q1…q7) = (4, 5, 7, 8, 10, 12, 20). Sketch the decode tree for this set of codes.