General InformationThis course will cover qualitative and quantitative analysis of algorithms and their corresponding data structures from a precise mathematical point of view. Topics include: performance bounds, asymptotic analysis, worst case behavior, proof of correctness and complexity. Particular classes of algorithms will be studied in detail, including greedy, divideandconquer, dynamic programming, networkflow, NPC and approximation algorithms.
Instructor: Dianna Xu , Park 203
See class Moodle

