Comp210 Lab Handouts

Comp210 labs have multiple goals, primary the following:

• Providing hands-on examples of course material with labbies available to help students.
• Introducing and explaining tools that will be useful in this and later courses, e.g., DrScheme, UNIX, Emacs, and C.
• Providing some supplementary material that hints at more advanced material.

The current lab assignments are which lab section each student officially assigned to. 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 handouts will be posted here as they become ready:

• Lab 1 -- Getting Started: registering, Netscape, DrScheme
• Lab 2 -- Design Recipe, Donkey, Law of Scheme, Style
• Lab 3 -- Data definitions
• Lab 4 -- define-struct
• Lab 5 -- Mutual recursion, UNIX basics
• Lab 6 -- Arithmetic Imprecision
• Lab 7 -- Generative recursion, Homework hints
• Lab 8 -- First-class functions
• Lab 9 -- More first-class functions, Emacs basics
• Lab 10 -- Side-effects
• Lab 11 -- JAM
• Lab 12 -- C intro
• Lab 13 -- C Errors and Debugging
• Lab 14 -- Lists in C, Connect 5
• Lab 15 -- Timing Sorting Algorithms

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