Course Link pop-ups require javascript, but without, links simply open target page as expected
Header Photo

CSC 281 Design and Analysis of Algorithms (3 credits)

This course presents fundamental techniques for designing efficient computer algorithms and analyzing their running times. Topics include asymptotics, solving summations and recurrences, sorting and selection, graph algorithms (depth-first and breadth-first search, minimum spanning trees, and shortest paths), algorithm design techniques (divide-and-conquer, dynamic programming, and greedy algorithms), and introduction to NP-completeness.

Prerequisite: CSC 201.