CS 603 - Algorithms

Unit(s): 4

This course covers algorithm analysis and asymptotic running time estimates; expected running times and amortized analysis; design techniques, including divide and conquer, greedy, and dynamic programming; algorithms for searching and sorting, graphs, and advanced topics.

Restriction: Level Restricted to Graduate
College of Arts and Sciences