Home | People | Curriculum
| Projects | Resources
| Media |

**Instructor:**
Steven Lindell

**Semester & Year:**
spring 2001

**Schedule:**
t.b.a.

**Text:**
t.b.a.

**Prerequisites:**
Math/Computer Science 231, Computer Science 206,
and some additional mathematics at the 200 level,
or consent of instructor.
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.

Page maintained by John Dougherty,
David Wonnacott, and Rachel
Heaton. |