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.

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

King Abdullah II School of Information Technology
Department of Computer Science


  • Saying goodbye to my wonderful faculty is more nostalgic than simple words can describe; it has truly become a second home. ... Eman Ennab

  • King Abdullah II College for Information Technology was and still maintains the pertinent atmosphere for volunteering in many sci ... Yousef Arabiat

  • Despite having differences between the study experiences and real work experience, the university is the pillar for building care ... Abed Abuhijleh