Q1. Define the term Space Complexity and time complexity. prepare down the reasons for measuring the space and time complexity. Describe trade-off between the time and space complexity.
Q2. prepare down an algorithm based on the divide and conquer methodology to sort n elements by using Quick sort and do the analysis.
Q3. Describe clearly, with an illustration, the concepts of the given:
a) Binary tree
b) Strictly Binary tree
c) Complete Binary tree
Q4. prepare down a C program to perform the given operations on a doubly linked list.
a) To create the list by adding each and every node at the front.
b) Display the elements in the reverse order.
Q5. Create the open hash table and closed hash table for the input:
30, 20, 56, 75, 31, 19 by using the hash function h(k) = k mod 11
Q6. prepare down an algorithm for constructing the Binary Search tree. While constructing the tree take care that duplicate values are not added. Trace the algorithm on the given data.
8, 13, 10, 12, 6, 9, 5, 2