| Date | Text Section |
Topic | |
|---|---|---|---|
| Sept. | 9 | 1.1 | The Wiki and Scheme--Functions and Names |
| 12 | 1.2, 1.3, 1.4 | Components of a Computer, Functions, Types of Data | |
| 14 | 2.1-2.3 | Scheme Lists, cons, car, cdr | |
| 16 | 2.4, 2.5 | Scheme Lists, Conditional Expressions | |
| 19 | 3.1 | Lambda, a Function to Create Functions | |
| 21 | 3.2, 3.3 | Function Specs, Local Bindings | |
| 23 | 4.1 | Lists of Arbitrary Length--Recursion | |
| 26 | 4.2, 4.3 | Traces, More Recursion on Lists | |
| 28 | Application: DNA and RNA | ||
| 30 | 4.4 | Recursion with Numbers | |
| Oct. | 3 | 5.1, 5.2 | Varieties of Recursion |
| 5 | 5.4, 5.5 | Nonlinear Recursion | |
| 7 | Catch-up and Review | ||
| 10 | FIRST IN-CLASS EXAM | ||
| 12 | 5.7 | Tail Recursion (Project 1 Out) | |
| 14 | 6.1 | Writing Tail Recursive Functions | |
| 17 | FALL BREAK | ||
| 19 | 6.2, 6.3 | Iteration and Stack Frames | |
| 21 | 7.1 | Local Bindings (again) | |
| 24 | 7.2, 7.3 | let and letrec | |
| 26 | 8.1 | Generator Functions | |
| 28 | 8.2 | Procedural Abstraction in Practice | |
| 31 | UNIX, Emacs and Scheme (Project 1 Due) | ||
| Nov. | 2 | Catch-up and Review | |
| 4 | SECOND IN-CLASS EXAM | ||
| 7 | 9.1 | State Changes and Output Ports | |
| 9 | 9.2, 9.3 | Input Ports, Sequences of State Changes | |
| 11 | 10.1, 10.2 | State Changes in Main Memory | |
| 14 | 11.1, 11.2 | List Box-and-Arrow Diagrams | |
| 16 | 11.3, 11.4 | Imperative Programming with Pairs | |
| 18 | The case Expression, Extending lambda. | ||
| 21 | 14.1 | Principles of Object Technology | |
| 23 | THANKSGIVING BREAK | ||
| 25 | THANKSGIVING BREAK | ||
| 28 | 14.2 | Implementation of OOP in Scheme | |
| 30 | 14.3 | Delegation and Inheritance | |
| Dec. | 2 | Substantial OOP Example (Project 2 Out) | |
| 5 | Catch-up and Review | ||
| 7 | THIRD IN-CLASS EXAM | ||
| 9 | Object Oriented Programming Project | ||
| 12 | Catch-up and/or Review for Final Exam (Project 2 Due) | ||
| 15 | FINAL EXAM (9:00am) |