Q1. Given a positive numbers wi, 1 <= i <= n and m. Determine all the subsets of wi whose sum is m.
Q2. describe how will you handle the overflow and collision detection in the hash table? Describe the methods.
Q3. Sort the given data by using merge sort. Describe the time complexity of the algorithm if the data size is n.
15, 10, 2, 11, 17, 12, 5, 8, 9, 1, 3, 13, 6, 14, 7, 16, 4
Q4. Illustrate an algorithm to free a block by using the boundary tags.
Q5. Describe an algorithm for inserting a string after ith character of the other string.
Q6. Describe the topological sort algorithm.