COMP 210 Lab Handouts: Fall 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.

lab-signup & info form.
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.

For your information: how to roll-your-own teachpack

Lab notes will be posted here as they become ready: These notes do not necessarily contain all the information from lab, since labs are flexible in response to participating students.

1. Getting Started: DrScheme, Design Recipe
2. Simple data definitions: cond, struct
3. Lists
4. Law of Scheme & Hand Evaluation; Accumulator
5. Exam debriefing; hand-evaluation of accumulator functions.
6. Descendent Trees
7. local: syntax, semantics, pragmatics
8. Optional: Mutual recursion to process your real-live disks
9. Practice with map; pre-calculus
10. Empirically measuring sorts
11. set-struct-field!, begin, some I/O
12. vectors, loops
13. An Abstract Data Type: Dictionary
14. (Optional -- offered Wed. 15:30 only) Why Computer's Don't (always) Add Correctly (to think about as you fly home for the holiday, in a computer-controlled airplane...)
15. (Optional -- offered dec.04 (Wed) 19:00 and dec.05 (thu) 13:00 only) Gamtree searching: Minimax and pruning (Connect5)

Previous semesters' labs cover essentially the same material, but with possibly different presentations: S02, F01, S01, F00, S00, F99, S99, F98, S98, F97, S97, F96, S96, F92

Some additional resources you may be interested in are

• Computing Short Courses on UNIX and other subjects
• Owlnet general info, including some online help on various subjects