Course Contents
The course is designed to cover advanced topics in algorithm analysis.
Course Synopsis
The course aims to provide a deep understanding of Algorithm analysis.
Course Learning Outcomes
Upon completion of the course, students should be able to explain the mathematical concepts used in describing the complexity of an algorithm, and select and apply algorithms appropriate to a particular situation.
No Information Yet
Book Title : Introduction to Algorithms
Author : T. Cormen, C. Leiserson, and R. Rivest
Edition :
Publisher : MIT Press and McGraw-Hill
Book Title : Computers and Intractability, Guide to the Theory of NP-Completeness
Author : M. Garey and D. Johnson
Edition :
Publisher :
Book Title : Formal models and Computability, in Handbook of Computer Science
Author : Tao Jiang, Ming Li, and Bala Ravikumar
Edition :
Publisher : CRC Press
Book Title : Introduction to Algorithms
Author : T.H. Cormen, et al.
Edition :
Publisher : MIT Press and McGraw-Hill BookCompany
Book Title : An Introduction to Formal Languages and Automata
Author : Peter Linz
Edition :
Publisher :
Book Title : Computers and Intractability, Guide to the Theory of NP-Completeness
Author : M. Garey and D. Johnson
Edition :
Publisher : Addison-Wesley
No Information Yet