| This table specifies when we cover which topics. The link in the first column connects this page to the homework that you will be working on for the corresponding week. The third column lists the sections in How to Design Programs that cover the lecture material.The last column list the dates, and special days, of the week. | Week | Topic of the Week | HtDP | Dates |
|---|
| Prerequisites | Preface, Sec. 1, 2 and 3 | 1/7, 1/9, 1/10 | | Atomic and Compound Data | 4-6 | 1/14, 1/16, 1/17 | | Unions | Sec. 7, 9, 10.1, and Intrmz. 1 | 1/23, 1/24 [MLK Jr.] | | Self-Referential Unions (1) | Sec. 9, 10, and 12 | 1/28, 1/30, 1/31 | | Self Referential Unions (2) | Sec. 14, 15, and 16 | 2/4, 2/6, 2/7 | | Local, Multiplexing | Int. 2 and 3 | 2/11, 2/13, 2/14 | | Recursion in All Forms | Int. 3, Sec. 16, 17, and 18 | 2/20, 2/21 [Pres. Day] | | Abstraction (1) | Sec. 19, 20, and 21 | 2/25, 2/27, 2/28 | | Abstraction (2) | Int. 4, and Sec 22 | 3/10, 3/12, 3/13 | | Generative Recursion | Sec. 23, and 27 | 3/17, 3/19, 3/20 | | More Generative Recursion | Sec. 28 and Int. 5 | 3/24, 3/26, 3/27 | | Accumulators | Sec. 30, 31, and 32 | 3/31, 4/2, 4/3 | | Putting it all together | HtDP+ | 4/7, 4/9, 4/10 |
All assignments will be updated ASAP. |