CST 387 ALGORITHM DESIGN
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.
(with a min grade of C-)
View the Course Finder for more detailed prerequisite information.
There are no additional notes for this course.