CS535 Algorithm Design and Analysis
Spring 2012
TR 4:00-5:15 pm
Instructor: Christine Cheng
EMS 1011 x5170
Office hours: Thursdays 2-4 pm or by appointment.
Schedule
- 1/24/12: Review of logarithms and exponentials (Sec. 1.3.2). Intro to asymptotic notation (Sec. 1.2).
- 1/26/12: Asymptotic notation cont'd. Intro to algorithm design (Sec. 1.4).
On Doing Homework . Homework 1, due 2/2.
- 1/31/12: Designing algorithms cont'd: prefix averages, binary search, maximum subsequences sum problem.
- 2/2/12: Designing algorithms cont'd: max subsequences sum cont'd. Intro to basic data structures (2.1): stacks and queues.
Homework 2, due 2/9.
- 2/7/12: Resizing arrays. Vectors.
- 2/9/12: Lists and Trees.
Homework 3, due 2/16.