Skip Ribbon Commands
Skip to main content


MS - Theory of Algorithms


This course provides strategies of algorithms synthesis and analysis. Design methodologies of classical algorithm categories such as: divide-and-conquer, greedy method, dynamic programming, search and traversal, backtracking, and branch-and-bound. Computational complexity and important theoretical results from lower-and upper-bound studies, NP-hard, and NP-complete problems will be addressed.

Academic Year

Graduate Level - Master


Created at 7/3/2015 12:48 AM by Basel Mahafzah
Last modified at 9/29/2018 1:01 PM by Basel Mahafzah