CS 673 - Algorithms

Unit(s): 4

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. Four hours lecture.

Restriction: Level Restricted to Graduate
College of Arts and Sciences