COMP 210 Lab Handouts -- Fall 2001
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:
Each student is assigned to a lab section.
You are welcome to attend other sections,
although people officially in a given section have preference in seating
and access to machines.
The Lab notes for future weeks are tentative.
- Lab 1: Getting Started: DrScheme, Design Recipe
- Lab 2: Simple data structures
- Lab 3: Lists
- Lab 4: More Lists, Natural Numbers
- Lab 5: Trees
- Lab 6: Mutual Recursion and Local
- Lab 7: Abstract Functions
- Lab 8: Arithmetic Imprecision (optional)
- Lab 9: Generative Recursion
- Lab 10: Missionaries and Cannibals
- Lab 11: State and a little I/O
- Lab 12: (exam review, and) Arithmetic
- (no lab nov.21-22 -- thanksgiving break)
- Lab 13: Assembly Language Programming
- Lab 14: Objects
These notes do not necessarily contain all the information from lab, since labs
are flexible in response to participating students' questions and pace.
Challenge Labs:
Challenge Lab #1: Macros and Simple I/O
Challenge Lab #2: More I/O, Web Server
Challenge Lab #3: Interpreter
Challenge Lab #4: Connect 5 Strategies
See the DrScheme Tips and Traps page!
Previous semesters' labs cover essentially the same material, but with possibly
different presentations: S01, F00,
S00, F99,
S99, F98,
S98, F97,
S97, F96,
S96, F92
Some additional resources you may be interested in are
Comp 210 homepage