1) Describe Knapsack Problem in detail with suitable ex.
2) Describe the algorithm for maximum and minimum numbers in the array.
3)(a) Give a detailed note on Divide and Conquer techniques with suitable ex.
(b) Sort the following set of elements using merge sort
12, 24, 8, 71, 4, 23, 6, 89, 56
4) prepare down an algorithm for searching an element using Binary search method. Give suitable ex.
5)(a) prepare a pseudo code for divide and conquer algorithm for merging two sorted arrays into a single sorted one. describe with suitable ex.
(b) Setup and solve a recurrence relation for number of key comparisons made by above pseudo code.
6)(a) prepare down the algorithm to sort a set of N numbers using insertion sort.
(b) Outline the algorithm for the following set of numbers.
7) Describe in detail merge sort. Demonstrate the algorithm with a suitable numeric ex. Provide complete analysis of the same.