King Abdullah II School of Information Technology - The University of Jordan - Theory of Algorithms

  Department of Computer Science

( Theory of Algorithms)
Course Description :

​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.

Pre Request :
Credit Hour :
Department :Computer Science
Program :MSc. of Computer Science
Course Level :Master
Course Outline :
1901715_Theory of Algorithms.pdf