Algorithm Design and Analysis

Algorithm Design and Analysis ( M.Tech, CSE, 2015 )

Introduction:    

      The main objective of this course is to acquire the techniques necessary to propose practical algorithmic solution for real world problems, which still permit strong theoretical bounds on time and space utilization. Students will study a wide collection of important and useful algorithms with necessary data structures in different areas of applications, focusing on fundamental concepts.      

Course Learning Outcomes:

Upon successful completion of this course, the student should be able to:

• Compare, differentiate and apply the key algorithmic design paradigms: Divide and conquer, dynamic programming, greedy, brute force etc.

• Compare, contrast, and apply algorithmic trade-offs: time vs. space, deterministic vs. randomized, exact vs. approximate

• Model and implement algorithms for various applications areas with suitable data structure. 

• Argue correctness of algorithms using different proof techniques. 

• Implement and apply fundamental algorithms and data structure to real-world problems.

Syllabus:

You can find the .pdf version [ here ].

Books:

    Text Book

T1. Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein. (CLRS)

    Reference Books

R1. Handbook of Data Structures and Applications by Dinesh P Mehta, Sartaj Sahni,  Chapman and Hall/CRC. 

R2. Algorithms by Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani, McGraw Hill Education (India) Pvt. Ltd.

R3. The Design and Analysis of Computer Algorithms by Aho, Hopcroft, Ullman, Addison-Wesley.

R4. Algorithm Design: Foundations, Analysis, and Internet Examples  by M. T. Goodrich, R. Tamassia, John Wiley & Sons.

R5. Algorithm Design by Jon Kleinberg, Éva Tardos, Pearson.

Evaluation:

Assignments:

Course Progress and Resources: [ *Reading list refers to Introduction to Algorithms by CLRS, Third Edition ]