CS 319 Algorithm Analysis
Prerequisites: CS 219, MATH 201 and MATH 207 (grade of C- or higher) or permission of the instructor. 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.
Offered
Spring Semester