Notice

These are, in general, the notes from which I lecture. They are, at best, only fairly complete. They certainly are not a substitute for attending class, taking notes, attending lab lecture, and reading the book. Their only purpose here is to help remind you of what was covered in class.

TAKE COMPLETE AND ACCURATE NOTES!!

The material in these notes may not correspond exactly to what was discussed in class due to the nature of class discussions, modified examples, and time constraints. You are responsible for all material whether presented in class or on the web pages.

Lesson #	Date	Subject
1	Mon. 8/25/03	Welcome! Administrivia, computing, simple programs
2	Wed. 8/27/03	Expressions and functions in Scheme, contracts
3	Fri. 8/29/03	Hand evaluation, design recipe, conditionals/booleans, conditional evaluation
	Mon 9/1/03	*Labor DayHoliday -- no classes!*
4	Wed. 9/3/03	More design recipe work, symbols and structures
5	Fri. 9/5/03	More structures, templates, abstract data, revised design recipe
6	Mon. 9/8/03	Compound data structures, abstraction/encapsulation, inheritance/composition
7	Wed. 9/10/03	Functions on compound data structures, intro to lists
8	Fri. 9/12/03	Recursion, examples of functions on lists
9	Mon. 9/15/03	Recursive construction of lists, Law of Scheme, lists of mixed data
10	Wed. 9/17/03	Mixed data cont., Natural numbers
11	Fri. 9/19/03	accumulator algorithms
12	Mon. 9/22/03	Review
13	Wed. 9/24/03	Exam #1 -- in class
14	Fri. 9/26/03	Review of templates for structures, Family Trees
15	Mon. 9/29/03	Family Trees cont., Functions of Two Non-Trivial Arguments, Process Flow Analysis
16	Wed. 10/1/03	Mutual Recursion: Descendent Trees, more Process Flow
17	Fri. 10/3/03	More mutual recursion: Whole-part hierarchies
18	Mon. 10/6/03	Locals
19	Wed. 10/8/03	More local, closures, functions as objects
20	Fri. 10/10/03	More closures, lambda functions, higher order functions
	10/13/03-10/14/03	*MIDTERM RECESS!!!*
21	Wed. 10/15/03	Mapping, folding & visiting
22	Fri. 10/17/03	Visitors cont.
23	Mon. 10/20/03	Review
24	Wed. 10/22/03	Review -- Exam 2: Time-limited take-home, due by Monday.
25	Fri. 10/24/03	Generative recursion: Divide-and-conquer -- Sorting
26	Mon. 10/27/03	Generative recursion: Sierpinski gaskets
27	Wed. 10/29/03	Sierpinski gaskets continued.
28	Fri. 10/31/03	Sierpinski gaskets continued, incl. functional-style drawing of fractals
29	Mon. 11/3/03	Depth and Breadth-first traversals
30	Wed. 1/5/03	set-[struct]-[field]! and mutable data
31	Fri. 11/7/03	Mutable data continued, graphs, depth-first traversal
32	Mon. 11/10/03	set!, using locals, factories and closures to control mutation
33	Wed. 11/12/03	breadth-first traversal; why to use `set!`
34	Fri. 11/14/03	Restricted Access Containers
35	Mon. 11/17/03	RACs and tree traversals
36	Wed. 11/19/03	State Design Pattern
37	Fri 11/21/03	Mutable lists: LRStruct
38	Mon. 11/24/03	Review
39	Wed. 11/26/03	Review. Take-home Exam 3
	11/27/03-11/28/03	*THANKSGIVING RECESS!!!*
40	Mon. 12/1/03	Strategy Designs, GUIs in Scheme
41	Wed. 12/3/03	To infinity...and beyond! (representing infinite lists -- lazy evaluation)
42	Fri. 12/5/03	Last day of classes!! Exam 3 due, Exam 3 solution discussion, lazy prime numbers

You can also look at the lecture notes from last spring or even earlier.

COMP 210: Principles of Computing and Programming

Lectures Fall 2003

Notice

TAKE COMPLETE AND ACCURATE NOTES!!

Lesson #

Date

Subject