Advanced topics in the design and analysis of algorithms such as amortized analysis, linear programming, network flows, randomized algorithms, NP-completeness, approximation algorithms, online algorithms, and parallel algorithms.  Students should have completed Calculus I and Discrete Mathematics before enrolling in this course.

Prerequisites: CS 501 or admissions to the Software Engineering MS program

0 Credits

View in Catalog