Skip to main content

Design and Analysis of Algorithms

Enrollment is Closed

About This Course

* To familiarize with algorithm design strategies
* To learn to analyse and measure the performance of algorithms


Introduction to Algorithm Analysis, Divide and Conquer Method, Greedy Strategy, Dynamic Programming, Algorithm Design by State Space Trees – Backtracking - Branch and Bound, Introduction to Computational Complexity.


1. A. Levitin, “Introduction to the Design & Analysis of Algorithms”, Pearson Education, 3rd Edition (2008).

2. Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran, “Fundamentals of Computer Algorithms”, Orient Longman, Universities Press, 2nd Edition (2008).

3. Harsh Bhasin, “Algorithms Design and Analysis”, Oxford University Press, 1st Edition (2015).

4. Rajesh K.Shukla, “Analysis and Design of Algorithms, A Beginner’s Approach”, Wiley (2015).

5. Richard Neapolitan , Kumarss Naimipour, “Foundations Of Algorithms “,Jones and Bartlett Publishers, Inc, 4th Edition (2011).

6. Sara Baase , Allen Van Gelder , “Computer Algorithms: Introduction to Design and Analysis”, Pearson India, 3rd Edition (2002).
7. Thomas H. Cormen, et al., “Introduction to Algorithms”, Prentice Hall, 3rd Edition (2010).

Course Staff

Course Staff Image #1


Shidha is a UGC-NET qualified staff received her MCA degree from Mother Teresa Women’s University, Kodaikanal and MPhil from Vinayaka Mission University, Salem. She is a research scholar in Bharathiar University, Coimbatore. She has 20 years of teaching experience and has been associated with FISAT since 2014. She started her career as Lecturer in 2001 and had worked with MES College, Marampally and Sree Narayana Institute of Science & Technology (SNGIST), N.Paravur. Her area of interest is Data Mining, Algorithm Analysis and Assembly Language Programming.