CS2251 - DESIGN AND ANALYSIS OF ALGORITHMS ANNA UNIVERSITY
PREVIOUS YEAR QUESTION PAPER DOWNLOAD
B.E./B.Tech. DEGREE EXAMINATION, APRIL/MAY 2010.
Fourth Semester
Computer Science and Engineering
CS2251 - DESIGN AND ANALYSIS OF ALGORITHMS
(Regulation 2008)
Time: Three hours
Maximum:100 marks
Answer ALL Questions.
PART A- (10 X 2= 20 marks)
1. Differentiate Time complexity from Space complexity.
2. What is a Recurrence Equation?
3. What is called Substitution method?
4. What is an Optimal solution?
5. Define Multistage Graphs.
6. Define Optimal Binary Search Tree.
7. Differentiate Explicit and Implicit Constraints.
8. What is the difference between a Live Node and a Dead
Node?
9. What is a Biconnected Graph?
10. What is a FIFO branch - and - bound algorithm?
PART B- (5 X 16 = 80 Marks)