Comp 210 Lectures

Fall 2002

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.

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

 

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