Courses: Analysis of Algorithms (MATHH340B01)

Spring 2011

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. Particular classes of algorithms such as sorting and searching will be studied in detail.

Prerequisites: CMSC 206.

Fulfills: NA II

Department

Mathematics (Web site)

Taught By

Steven Lindell (Profile)

Location

Haverford, Hlls 110

Meeting Times

MW 12:30-2:00