www.notesannauniv.blogspot.in Internal Exam- I Sub. Code : CS6402 Sub. Name : Design and Analysis of Algorithms Department of Computer Science and Engineering & Information Technology Year: II Answer ALL Questions Part- A (10X2=20 Marks) 1. Define the term algorithm and mention its properties 2. What do you meant by a combinational problem 3. Write the concept of time and space complexity 4. What is recurrence equation? 5. What is time space tradeoff? 6. What is exhaustive search? 7. What is convex hull problem? 8. What is meant by divide and conquer 9. Define binary search 10. What is the difference between quick sort and merge sort Part- B 11.a) Write the processing steps in algorithmic problem solving

(16)

(or) b) Explain about fundamentals of algorithm efficiency

(16)

12.a.(i) Write notes on asymptotic notations and its properties

(10)

(ii) Give short notes on important problem types (or)

(6)

www.notesannauniv.blogspot.in b) Explain in detail about mathematical analysis for recursive and non recursive algorithm with an example

(16)

13.a)Explain travelling salesman problem with example

(16)

(or) b) Explain knapsack and assignment problem with example

(16)

14.a) Derive an algorithm to sort the following elements using merge sort technique 38,27,43,3,9,82,10

(16) (or)

b) Derive an algorithm to sort the following elements using Quick sort technique 50,30,10,90,80,20,40,70

(16)

15.a. (i) Write down the formula used by Strassen's method for multiplication of two matrices (6) (ii) State the formula for Multiplying two large numbers using divide and conquer method with 49 X 82

(10) (or)

b.(i) Write short notes on binary search with example

(8)

(ii) State efficiency analysis of divide and conquer

(8)