Qualitative and quantitative analysis of algorithms and their corresponding data structures from a precise mathematical point of view. Performance bounds, asymptotic and probabilistic analysis, worst case and average case behavior. Correctness and complexity. Quantitative GEP requirement.
Prerequisites
CSC 202 and MTH 205.
Notes
Minor, Elective credit.