| Date | Reading | Topic | Assignment Due |
|---|---|---|---|
| 9/3 | 1.1-1.2 | Introduction; simple expressions | |
| 9/4 | Project 0: An Ungraded Introduction | ||
| 9/5 | 1.2-1.3 | Compound procedures; conditionals | |
|
|
|||
| 9/8 | 2.1 | Recursion | Homework #1 |
| 9/9 | Project 1: Quilting | ||
| 9/10 | 2.2 | Induction | |
| 9/11 | Project 1 (continued) | ||
| 9/12 | 2.3-2.4 | Further examples & custom-sized quilts code for digit procedures |
|
|
|
|||
| 9/15 | 3.1 | Iteration code for class | Homework #2 |
| 9/16 | Project 1 (continued) | ||
| 9/17 | 3.2 | Using invariants | |
| 9/18 | Project 1 (concluded) | ||
| 9/19 | 3.2, 3.3 | One more induction proof Perfect numbers, internal definitions, & let code for class |
|
|
|
|||
| 9/22 | 3.3,3.4 | Section 3.3 cont., Iterative improvement code for class |
|
| 9/23 | Project 1.5: Empirical Time Tests (ungraded) | ||
| 9/24 | 4.1 | Orders of growth |
Project 1 Homework #3 |
| 9/25 | Project 2: Orders of Growth | ||
| 9/26 | 4.1 | More on orders of growth analyze this code |
|
|
|
|||
| 9/29 | Review |
||
| 9/30 | Test #1, 7:00-8:30 pm in Olin 103 Project 2 (continued) |
||
| 10/1 | 4.2 | Tree recursion and digital signatures, |
|
| 10/2 | Project 2 (continued) | ||
| 10/3 | More on tree recursion and digital signatures; code for class |
||
|
|
|||
| 10/6 | Writing project reports | ||
| 10/7 | Nobel Conference (no lab) | ||
| 10/8 | Nobel Conference (no class) | ||
| 10/9 | Project 2 (continued) | Homework #4 | |
| 10/10 | Project 2 peer review | Project 2 report, first draft |
|
|
|
|||
| 10/13 | 5.1 | Procedural parameters code for class code we wrote in class |
|
| 10/14 | Project 3: Fractal Curves | ||
| 10/15 | 5.2 | Uncomputability | Project #2 |
| 10/16 | Project 3(cont) | ||
| 10/17 | Reading break (no class) | ||
|
|
|||