Computer Science

CSC 380: Design and Analysis of Algorithms

Course Description:

Algorithm design paradigms such as divide and conquer, greedy, and dynamic programming; techniques for algorithm analysis, such as asymptotic notations and estimates, as well as time/space trade-offs. Topics may include sorting, searching, scheduling, string matching, graph algorithms, amortized analysis, and computational geometry.

Prerequisites:

CSC 133 and MAT 161 and (CSC 231 or CSC 332)

Current Semester Pages: