Roosevelt University in Chicago, Schaumburg and Online - Logo

Course Details


Design and analysis of polynomial-time algorithms and supporting data structures. Applications are in networking, systems programming, database design, and other applications. Topics include minimum spanning tree algorithms and their fast implementation with Fibonacci heaps and Disjoint Sets data structures, shortest path algorithms, flow networks, linear programming. Proving correctness and worst case runtime analysis of algorithms. A computer use course.

Credits:  3


There are no prerequisites listed for this course.

Course Notes:

Cst 280 and Math 245 both with a min grade C- required.