| Week | Topic covered | Related Chapter |
| 1 | Design Recipe 1: Simple program Design Recipe 2: Basic Condition Refactoring 1 |
Htdp Chapter 1 - 2 |
| 2 | Design Recipe 2: Complex condition Compound Data Binary Tree Sample Code for binary tree (C version) |
Htdp Chapter 3 - 4 |
| 3 | Automata |
None |
| 4 | Introduction to
Compiler Construction Bootstrapping Language Deterministic Finite Automata (DFA) Sample Code for DFA for C Identifier (C version): |
CCG Chapter 1 - 3 CCG Chapter 5 |
| 5 | Language Specification Calculator Sample Code (C version) dc.cpp |
CCG Chapter 5 |
| No. | Assigned date | Description | Due |
| 1 | June 7, 2005 | Procedural Programming Languages | June 19, 2005 |
| 2 | July 4, 2005 | Functional Programming Languages | July 14, 2005 |
| 3 | July 11, 2005 | Object-Oriented Programming Langauges | July 21, 2005 |
| No. | Assigned date | Description | Due |
| 1 | June 9, 2005 | Unit conversion | June 12, 2005 |
| 2 | June 14, 2005 | Ternary tree | June 21, 2005 |
| 3 | June 20, 2005 | Automata | June 23, 2005 |
| 4 | June 27, 2005 | DFA | June 30, 2005 |
| 5 | June 28, 2005 | Implementation of DFA for keywords | July 4, 2005 |
Personal Software Process (PSP)