Note: Final answers only. However, you have to upload every small piece of rough work done. 
Submit answers at courses.iiita.ac.in and rough works at Google Form (link will be given by email)
Very lengthy paper, you will not be able to attempt all questions.

question no. 1: 
Give the output of the hash table of size 10 after the following items are inserted in the same orderusing double hashing with hash functions h1(x)=3x and h2(x)=2x+1. If a key appears twice, it must be inserted both times. 
Print 10 numbers as the 10 entries in the hash table (0-indexed). Print -1 if a slot is empty. 
2 5 15 9 8 

question no. 2: 
Sort the following array by using Radix Sort. 
Show the output matrix array after each iteration of Radix Sort.
If the algorithm's outer loop runs 3 times, print 3 lines of output with every line printing the array after that iteration.
799 99 331 836 984 

question no. 3: 
To solve the length of the Longest Common Subsequence between strings X and Y, the matrix D[][] is made where the rows correspond to X and the columns correspond to Y 
Show the output matrix D for the following input.
X=aeebd
Y=ecaebd

question no. 4: 
Give the complexity of the following. Use notations pow(n,4)lg(n) or similar. Answer to every part should appear in a newline: 
a) T(n)=16T(n/2) + power(n,4)
b) T(n)=81T(n/3) + power(n,2)
c) T(n)=81T(n/3) + power(n,1)
d) T(n)=8T(n/2) + power(n,3)
e) T(n)=4T(n/2) + power(n,5)


question no. 5: 
Give the output of the Build Max Heap function as an array to make a Max Heap with the largest element as the root, on the following input arrays. The answer to every part should be in a new line: 
a) 8 6 4 16 16 18 5 
b) 3 3 16 11 6 6 0