CS 658 - Algorithms II3 Credits
A continuation of CS 458/558. A complete study of algorithm design techniques, including dynamic programming, greedy algorithms, divide and conquer, network flow, linear programming. Students are able to use these techniques to design algorithms for new computational tasks, including proving the running time and correctness of the algorithms. The course also focuses on NP-complete problems and techniques and analysis for handling computationally hard problems, including approximation algorithms and fixed-parameter algorithms.
Prerequisites
CS 458 with a C or better or CS 558 with a C or better
When Offered
Spring - Odd Years
Click here for the Fall 2025 Class Schedule
Click here for the Spring 2026 Class Schedule
Click here for the Summer 2026 Class Schedule
Add to Portfolio (opens a new window)
|