2015-2016 University Catalog 
  
2015-2016 University Catalog

CS 583 - Analysis of Algorithms

Credits: 3
Not Repeatable
Topics include analyzing sequential and parallel algorithmic strategies such as greedy methods, divide and conquer strategies, dynamic programming, search and traversal techniques, and approximation algorithms; and analyzing specific algorithms falling into these classes, NP-Hard and NP-Complete problems.

Prerequisite(s): CS 310 and CS 330 and MATH 125.

Hours of Lecture or Seminar per week: 3
Hours of Lab or Studio per week: 0