01-11-2016, 12:25 PM
1462949232-Int1.doc (Size: 39 KB / Downloads: 7)
PART-A (7*2=14)
1. What are the components of fixed and variable part in space complexity? [N/D 13]
2. Define algorithm validation. [N/D 12]
3. Using the step count method analyze the time complexity when 2 mxn matrices are added. [A/M 11]
4. Establish the relation between O and Ω. [N/D 10]
5. What is meant by divide and conquer technique? What kind of problems can be solved using divide and conquer method? [A/M 13]
6.List out two drawbacks of binary search algorithm.What is the time complexity of binary search? [A/M 11,12 N/D 07]
7. What is the difference between quick sort and merge sort? [A/M 13]
PART-B (3*12=36)
1.i)Explain the Towers of Hannoi problem and solve it using recursion.[N/D 13,A/M 14](6)
ii)Derive the recurrence relation for Fibonacci series algorithm; also carry out the time complexity analysis. [A/M 14](6)
2.Trace the steps of mergesort algorithm for the elements 122,25,70,175,89,90,95,102,123 and also compute its time complexity. [N/D 12]
3.Explain Binary search algorithm and its complexity in detail. [A/M 09,11,15 N/D 11,12,14]