Close Menu

CS 535 - Design and Analysis of Algorithms

Course Description: 

Design of efficient algorithms for a variety of problems, with mathematical proof of correctness and analysis of time and space requirements. Topics include lower bounds for sorting and medians, amortized analysis of advanced data structures, graph algorithms (strongly connected components, shortest paths, minimum spanning trees, maximum flows and bipartite matching) and NP-Completeness.

Credit: 

(3-0-3)

Prerequisite: 

[(CS 430 with min. grade of C)]

Corequisite: 

None

Attachments: