| Date | Reading | Topic | Due
|
|---|
| 9/8 | 10.1-10.2 | Introduction to EBNF and Micro-Scheme |
|
| 9/9 | | Lab
1: Extending Evaluators |
|
| 9/10 | 10.2-10.3 | EBNF and Micro-Scheme |
|
|
| 9/13 | 10.3 | More on Micro-Scheme |
|
| 9/14 | | Lab 1 (continued) |
|
| 9/15 | 10.3-10.4 | Yet more on Micro-scheme; start Mini-Scheme |
|
| 9/16 | | Lab 1 (continued) |
|
| 9/17 | 10.4 | Global definitions: Mini-Scheme |
|
|
| 9/20 | 10.5 | Adding explanatory output |
|
| 9/21 | | Lab 1 (continued) |
|
| 9/22 | 11.1-11.2 | The SLIM architecture | Homework #1
|
| 9/23 | | Lab 1 (concludes) |
|
| 9/24 | 11.3-11.4 | SLIM's instruction set;
start iteration |
|
|
| 9/27 | 11.4 | Iteration in assembly language | Lab #1
|
| 9/28 | | Lab
2: SLIM Assembly Language Programming |
|
| 9/29 | 11.5 | Recursion in assembly language |
|
| 9/30 | | Lab 2 (continued) |
|
| 10/1 | 11.6 | Memory in Scheme |
|
|
| 10/4 | | Review/catchup | Homework #2
|
| 10/5 | | Nobel Conference (no lab)|
| | 10/6 | | Nobel Conference (no class)|
| | 10/7 | | Lab 2 concludes and Test #1, 7:00-9:00 pm in
Olin 317 |
| | 10/8 | 12.1-12.2 | Revisiting tree recursion |
|
| | 10/11 | 12.3 | Memoization | Lab #2
| | 10/12 | | Lab
3: Formatting paragraphs |
| | 10/13 | 12.4 | Dynamic programming |
| | 10/14 | | Lab 3 (continued) |
| | 10/15 | 12.5 | Comparing memoization and dynamic
programming |
|
| | 10/18 | 13.1-13.2 | Arithmetic expressions revisited |
| | 10/19 | | Lab 3 (concludes) |
| | 10/20 | 13.2-13.3 | Arithmetic expressions and
RA-stacks | Lab #3
| | 10/21 | | Lab
4: Robots | Homework #3
| | 10/22 | | Fall break (no class)|
|
| | | |