The topics are linked to detailed weekly lecture plans below. The readings point into the on-line version of the text book.
You are primarily responsible for the readings. The lectures will help you understand those and will occasionally add highly pragmatic tips. But, the weekly problem sets and the exams will cover the reading material.
A semester tends to unfold in unpredictable ways, meaning the syllabus is subject to change. The most likely change concerns the last two weeks, which cover material that varies from semester to semester.
Assignments are due at 10:00 pm on the day they are listed (either Tuesday or Thursday).
See the late policy about late submissions.
Why CS; Arithmetic of numbers, strings; Administrivia, Lab 0
Arithmetic of images, functions, simple animations
Arithmetic of booleans, Conditionals, Intervals, Lab 1
Posns, structure type definitions, Steps of function design, Lab 2
Functions on structures
Itemizations, functions on itemizations, Lab 3
Self-referential data definitions
Self-referential unions, Lists, Lab 4
Lists, Functions on Lists
Design of a list-based world program, 1, Lab 5
Design of a list-based world program, 2; Processing two complex inputs
Midterm coming up: 05/30 @ in class
Memorial Day, No class
Similarities in functions
Abstractions over similar functions, Lab 6
Abstracting over DDs, Existing abstractions, Lab 7
Lambda and Scope
Sets, Mutual Recursion, S-expressions, Lab 8
Trees and Forests
Graphs, Lab 9
Generative Recursion, Lab 10
Midterm coming up: 06/19 @ in class
Accumulators, Lab 11