Design and Analysis of Algorithms

Course Name: 

Design and Analysis of Algorithms (CO353)

Programme: 

B.Tech (CSE)

Semester: 

Sixth

Category: 

Programme Core (PC)

Credits (L-T-P): 

03 (3-0-0)

Content: 

Models of computation, Various performance measures, General techniques of algorithm design, Analysis of different algorithms for sorting and selection, Data structures for efficient manipulation of sets and partition, Efficient Graph algorithms based on Depth first search, Strassen's matrix multiplication algorithm, Efficient algorithms for matrix inversion and LUP decomposition, Modular arithmetic, NP-complete problems and approximation algorithms.

References: 

1. Aho, Hopcroft and Ullman, "The Design and Analysis of Computer Algorithms", Addison Wesley.
2. Horowitz and Sahni, "Fundamentals of Computer Algorithms", Galgotia Publications, 2000.
3. Knuth D.E., "The Art of Computer Programming, Vol. I: Fundamental Algorithms", Addison Wesley, 2000.
4. Baase S.,"Computer algorithm introduction to design and analysis",Addison Wesley, 2000.

Department: 

Computer Science and Engineering
 

Contact us

P Santhi Thilagam
Associate Professor and Head
Department of CSE, NITK, Surathkal
P. O. Srinivasnagar, Mangalore - 575 025
Karnataka, India.

  • Hot line: +91-0824-2474060

Connect with us

We're on Social Networks. Follow us & get in touch.