Instructor: Dave Kauchak
e-mail: [first_initial][last_name]@stanford.edu
office hours: Monday 11-12am, Gates 195
TA: Wenxiu Ma
e-mail: [first_name]@stanford.edu
office hours: Wednesday 4-6pm, Gates B24A
location: Gates B01
web page: http://www.stanford.edu/class/cs161/
discussion board: http://groups.google.com/group/su_cs161_sum09
textbook:
| Date | Topic | Reading | Notes/Handouts |
|---|---|---|---|
| 6/24 | Admin. material, Introduction | Ch. 1, 2 | Admin material, Introduction.v3 |
| 6/29 | O-notation | Ch. 3 | BigO, BigO Slides.v2 |
| 7/1 | Recurrences | Ch. 4.1-4.3 | Recurrences.v3, Recurrences Slides.v2 |
| 7/6 | Quicksort, Randomized algorithms | Ch. 7,8.1-8.3 | Quicksort, Quicksort slides |
| 7/8 | Elementary data structures, Heaps | Ch. 6, 10 | |
| 7/13 | Binary search trees, B-Trees | Ch. 12,18 | |
| 7/15 | Hashtables | Ch. 11, except 11.3.3 & 11.5 | |
| 7/20 | Midterm | ||
| 7/22 | Graph algorithms | Ch. 22 | |
| 7/27 | Minimum spanning trees and single source shortest paths | Ch. 23, 24 | |
| 7/29 | Greedy algorithms | Ch. 16, except 16.4 | |
| 8/3 | Dynamic programming | Ch. 15, except 15.5 | |
| 8/5 | String algorithms | Ch. 32, except 32.4 | |
| 8/10 | MapReduce? | ||
| 8/12 | Advanced algorithms/Review | ||
| 8/14 | Final | 3:30pm - 6:30pm |