Design and Analysis of Algorithms

Course: AMT 211 2.0 Design and Analysis of Algorithms (Compulsory)

Course content: 

Mathematics for the Analysis of Algorithms, Introduction to Algorithm Design, Validation and Analysis, Analysis of Algorithms, Time Complexity of Searching and Shorting Algorithms, Algorithm Design Strategies

Recommended Readings: 

1. Cormen,T.H., Leiserson,C.E., & Rivest,R.L. (1990). Introduction to Algorithms (2^nd ed). MIT Press/McGraw-Hill.
2. Grossman, J.W. (1990). Discrete Mathematics (An Introduction to Concepts, Methods, and Applications) (1^st ed). Macmillan Publishing Company.
3. Greene,D.H. & Knuth,D.K. (1990). Mathematics for the Analysis of Algorithms (3^rd ed). Birkhauser.