CS 520 Algorithm Analysis

Prerequisites: MATH 505, Calculus and CS 519 Introduction to the analysis and design of algorithms. Topics include: sorting , searching, advanced tree structures, graph algorithms, network flow problems, amortized analysis, divide-and-conquer, greedy algorithms, dynamic programming, combinatorial search algorithms, computational geometry and NP-completeness.

Credits

3.0

Offered

Spring Semester