COMP 210 Lab Handouts: Spring 2003

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.

Labs will be held the first week of class; the first lab familiarizes you with DrScheme, so that you can do the first homework.

There are two sections. You are welcome to attend either, as we don't expect overcrowding to be an issue.

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, structs
3. Lists
4. Natural numbers
5. Exam debriefing, Accumulators
6. Mutually Recursive Data
7. local and scope
8. Abstract functions
9. Timing Sorting Algorithms
10. Generative Recursion
11. State and a Little I/O
12. Vectors and Loops
13. Dictionaries
14. Strategies for Project Extra Credit

Previous semesters' labs cover essentially the same material, but with possibly different presentations: F02, 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