Week #
Date
Material Covered
01 02/01 Introduction to Scheme and Recursion
02 02/08 Abstraction and Trees
03 02/15 Graphs, Contracts, Modules
04 02/22 Higher-Order Functions, Games, and Graphs
05 03/01 HOF review, Big-O, Induction
06 03/08 Parsing and Dijkstra's
07 03/31 Midterm review; More Parsing and Dijkstra's
08 04/05 Box and Pointer; Introduction to OO
09 04/12 Macros, Lazy Lists, Least Squares, Gradient Fitting, and Mutation/Aliasing
10 04/19 Dynamic Programming, Segmented Least Squares, Tail Recursion. Random code and segmented LS
11 04/26 Clustering, Impossible Programs, and List of Topics.