COM 304 ALGORITHMS
An introduction to the analysis of algorithms, both for run-time complexity and correctness. Students will use these skills as they learn and practice fundamental algorithm design techniques, including greedy, divide-and-conquer, dynamic programming, and network flow. The course concludes with a study of NP-completeness and methods for coping with NP-hard problems such as local search, randomization, and approximation algorithms.
Registration Restrictions
Restricted to Computer Science majors and minors.
Enrollment Limit
Enrollment limited to 18 students.