SUBJECT - ALGORITHM ANALYSIS AND DESIGN
CODE - NIL
SEMESTER - SIXTH
BRANCH - CSE
UNIVERSITY - MG
YEAR - 2009
DOWNLOAD LINK AVAILABLE AT THE END OF THIS POST
Answer all Questions
1.Briefly exlain about pseudo code convertors.
2.List out the differences between deterministic and non-deterministic algorithms.
3.Write a technical note on "Binary Search".
4.List out the differences between Merge and Quick Sort.
5.Describe control abstraction for greedy strategy.
6.Discuss briefly about Prim's Algorithm.
7.Derive a lower bound for selection problem.
8.Write a short note on multi-stage graph problem.
9.Discuss briefly about Bounding functions.
10.Discuss briefly about "FIFO".
(10x4=40 marks)
Part B
Each Question carries 12 marks.
11.(a) What is an algorithm? Discuss in detail about its properties. Mention its differences.
Or
(b) Discuss in detail about recurrence relations and recurrence trees for complexity calculations.
12.(a) Write a technical note on divide and conquer matrix multiplication.
Or
(b) Write a technical note on Merge and Quick Sort.
13.(a) Explain knapsack problem.Also devise a greedy method to solve the problem.
Or
(b) Describe Kruskal's algorithm. Find the time complexity for the algorithm.
14.(a) Explain travelling salesman problem. Suggest a suitable solution for that.
Or
(b) Discuss in detail about oracles and Adversary Arguments.
15.(a) Discuss the sum of subsets problem and find a solution for it using back tracking.
Or
(b) Describe how 15 puzzle problem is solved.
(5x12=60 marks)
Click Here For PDF
No comments :
Post a Comment