Design and Analysis of Algorithms MODEL QUESTION PAPERS (MQP) for CS 4 Sem 2018 scheme | VTU CBCS (18CS42 )


























OTHER DETAILS

Course Outcomes:

The student will be able to :

• Describe computational solution to well known problems like searching, sorting etc.

• Estimate the computational complexity of different algorithms.

• Devise an algorithm using appropriate design strategies for problem solving.

 

Question Paper Pattern:

• The question paper will have ten questions.

• Each full Question consisting of 20 marks

• There will be 2 full questions (with a maximum of four sub questions) from each module.

• Each full question will have sub questions covering all the topics under a module.

• The students will have to answer 5 full questions, selecting one full question from each module.

 

Textbooks:

1. Introduction to the Design and Analysis of Algorithms, Anany Levitin:, 2rd Edition, 2009. Pearson.

2. Computer Algorithms/C++, Ellis Horowitz, Satraj Sahni and Rajasekaran, 2nd Edition, 2014, Universities Press

 

Reference Books:

1. Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronal L. Rivest, Clifford Stein, 3rd Edition, PHI.

2. Design and Analysis of Algorithms , S. Sridhar, Oxford (Higher Education).

 

Post a Comment

Previous Post Next Post