COMP 210 Lab Handouts: Spring 2002
These labs have multiple goals, primary the following:
- Providing hands-on examples of course material with labbies
available to help students.
- Showing some extensions of material covered in class.
- Providing some optional challenging material.
- Introducing and explaining DrScheme, the main tool used in this course.
There will be weekly lab notes, but no graded assignments beyond the
homeworks distributed in lecture.
You may be held responsible for knowing any information
from the labs, except as otherwise noted.
Lab sections (signup and roster):
Each student is assigned to a lab section.
You are welcome to attend other sections,
although people officially in a given section have preference should
an instance of that section be overcrowded.
Lab notes will be posted here as they become ready:
- Getting Started: DrScheme, Design Recipe
- Simple data structures
- Lists
- Other recursive data
- More trees
- Functions with multiple complex arguments
-
local
- Abstract functions
- Generative recursion
- Accumulators
- State & a little I/O
- More state, including vectors
These notes do not necessarily contain all the information from lab,
since labs are flexible in response to participating students.
Previous semesters' labs cover essentially the same material, but with
possibly different presentations:
F01,
S01,
F00,
S00,
F99,
S99,
F98,
S98,
F97,
S97,
F96,
S96,
F92
Optional "challenge" labs:
- Simple I/O and Programs as Data
Some additional resources you may be interested in are
Comp 210 homepage