CS2251 Design and Analysis of Algorithms May June 2014 Question Papers

[DhilipPrabakaran]

   

Anna University , Chennai

Question Paper Code : 51341 

B.E./B.Tech. DEGREE EXAMINATION, MAY/JUNE 2014. 

Fourth Semester 

Computer Science and Engineering 

CS 2251/CS 41/CS 1251/080230013/10144 CS 402 — DESIGN AND ANALYSIS OF ALGORITHMS 

(Regulation 2008/2010) 

(Common to PTCS 2251 — Design and Analysis of Algorithms for B.E. (Part-Time) 

Third Semester — Computer Science and Engineering — Regulation 2009) 

Time : Three hours 

Maximum : 100 marks 

Answer ALL questions. 

PART A— (10 x 2 20 marks) 

1.What is average case analysis? 

2.Define program proving and program verification. 

3.State the principle of Substitution method. 

4.Define feasible and optimal solution. 

5.State Principle of optimality. 

6.List out the advantages of Dynamic programming. 

7.What are explicit and implicit constraints? 

8.What is chromatic number? 

9.Define connected components. 
10.Compare NP-hard and NP-completeness. 



Full Name : Dhilip Prabakaran
College Name : Dhanalakshmi College of Engineering
Department : Computer Science and Engineering
Semester : 4
Subject Code : CS2251
Subject Name : Design and Analysis of Algorithms
Study Material Description : Question Paper of CS2251 Design and Analysis of Algorithms May June 2014.


Attachment :

  DAA MJ14 VP.pdf (Size: 2.08 MB / Downloads: 3,344)

[Srini]

+2