IT252

Course Name: 

Design and Analysis of Algorithms(IT252)

Programme: 

B.Tech (IT)

Semester: 

Fourth

Category: 

Programme Core (PC)

Credits (L-T-P): 

(3-0-2) 4

Content: 

Brief overview of Functions, Relations and Sets; 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; Exercises to apply & practice the advanced algorithms: graph algorithms, internet algorithms etc. and analyze them.

References: 

Aho, Hopcroft and Ullman the design and analysis of Computer Algorithms, Addison Weseley.
Horowitz and Sahni, Fundamentals of Computer Algorithms, Galgotia Publications, 1985.
Baase S., Computer Algorithm Introduction to Design and Analysis, Addison Wesley.
Knuth D.E., The Art of Computer Programming, Vol. I: Fundamental Algorithmsa, Addison Wesley.

Department: 

Information Technology
 

Contact us

G. Ram Mohana Reddy

Professor and Head,
Department of Information Technology, NITK, Surathkal,
P. O. Srinivasnagar, Mangalore - 575 025
Karnataka, India.
Ph.:    +91-824-2474056
Email:  infotech[AT]nitk[DOT]ac[DOT]in
            infotech[AT]nitk[DOT]edu[DOT]in

Sowmya Kamath S (Web Admin)

Connect with us

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