Lecture 1: DrRacket and arithmetic (Sunday, August 21, 11:59pm)
Lecture 2: Definitions (Tuesday, August 23, 11:59pm)
Problem set 1: Paint a date in DrRacket (Wednesday, August 24, 11:59pm)
Lab 1: Getting started (Friday, August 26, 11:59pm)
Reading 1: Who can define the bigger number? (Sunday, August 28, 11:59pm)
Lecture 3: Parentheses (Sunday, August 28, 11:59pm)
Lecture 4: The design recipe (Tuesday, August 30, 11:59pm)
Problem set 2: Robert Indiana (Wednesday, August 31, 11:59pm)
Lab 2: The design recipe (Friday, September 2, 11:59pm)
Reading 2: Can machines think? (Sunday, September 4, 11:59pm)
Lecture 5: Labor Day (Sunday, September 4, 11:59pm)
Lecture 6: Multiple cases (Tuesday, September 6, 11:59pm)
Problem set 3: Moving rockets (Wednesday, September 7, 11:59pm)
Lab 3: Multiple cases (Friday, September 9, 11:59pm)
Lecture 7: big-bang for interactive animations (Sunday, September 11, 11:59pm)
Reading 3: Limitations of artificial intelligence (Tuesday, September 13, 11:59pm)
Lecture 8: Structures (Tuesday, September 13, 11:59pm)
Problem set 4: Composing functions (Wednesday, September 14, 11:59pm)
Lab 4: Structures (Friday, September 16, 11:59pm)
Lecture 9: More structures (Sunday, September 18, 11:59pm)
Lecture 10: Unions of structures (Tuesday, September 20, 11:59pm)
Lab 5: Unions (Friday, September 23, 11:59pm)
Lecture 11: More points (Sunday, September 25, 11:59pm)
Lecture 12: Unlimited data (Tuesday, September 27, 11:59pm)
Problem set 5: Enumerations and structures (Wednesday, September 28, 11:59pm)
Lab 6: Recursive unions (Friday, September 30, 11:59pm)
Reading 4: Software aspects of strategic defense systems (Sunday, October 2, 11:59pm)
Lecture 13: More self-reference (Sunday, October 2, 11:59pm)
Lecture 14: Built-in structures (Tuesday, October 4, 11:59pm)
Problem set 6: Unions and recursion (Wednesday, October 5, 11:59pm)
Lab 7: Lists (Friday, October 7, 11:59pm)
Lecture 15: Space invaders (Sunday, October 9, 11:59pm)
Lecture 16: Abstraction (Tuesday, October 11, 11:59pm)
Problem set 7: Lists (Wednesday, October 12, 11:59pm)
Lab 8: The table method (Friday, October 14, 11:59pm)
Reading 5: Hacking the cis-tem (Sunday, October 16, 11:59pm)
Lecture 17: Local definitions (Sunday, October 16, 11:59pm)
Lecture 18: Built-in abstractions (Tuesday, October 18, 11:59pm)
Problem set 8: Abstraction (Wednesday, October 19, 11:59pm)
Lab 9: Blending curves (Friday, October 21, 11:59pm)
Lecture 19: Follow the template (Sunday, October 23, 11:59pm)
Lecture 20: Mutual recursion (Tuesday, October 25, 11:59pm)
Lab 10: Forking turtles (Friday, October 28, 11:59pm)
Lecture 21: Simultaneous processing (Sunday, October 30, 11:59pm)
Lecture 22: Merge sort (Tuesday, November 1, 11:59pm)
Problem set 9: Plotting functions (Wednesday, November 2, 11:59pm)
Lab 11: Generative recursion 1 (Friday, November 4, 11:59pm)
Lecture 23: Quick sort (Sunday, November 6, 11:59pm)
Lecture 24: Measuring and drawing curves (Tuesday, November 8, 11:59pm)
Problem set 10: Prefix trees (Wednesday, November 9, 11:59pm)
Lab 12: Generative recursion 2 (Friday, November 11, 11:59pm)
Reading 6: Toilets (Sunday, November 13, 11:59pm)
Lecture 25: Accumulators (Sunday, November 13, 11:59pm)
Lecture 26: Route finding (Tuesday, November 15, 11:59pm)
Problem set 11: Generative recursion (Wednesday, November 16, 11:59pm)
Lab 13: Accumulators and generative recursion (Friday, November 18, 11:59pm)
Reading 7: Safety (Sunday, November 27, 11:59pm)
Lecture 27: The road not taken (Sunday, November 27, 11:59pm)
Lecture 28: Designing a neuron (Tuesday, November 29, 11:59pm)
Problem set 12: Accumulators (Wednesday, November 30, 11:59pm)
Lab 14: Bus mapping (Friday, December 2, 11:59pm)
Lecture 29: Neural networks (Sunday, December 4, 11:59pm)
Lecture 30: How long does it take? (Tuesday, December 6, 11:59pm)
Lab 15: Final exam prep (Friday, December 9, 11:59pm)