Comp210 Lab Handouts, Fall 1996

Lab handouts will be available here as they become ready. Labs in the first part of the semester willl focus on programming in Scheme. Labs in the last part of the semester will introduce C and Java.

The lab roster lists which lab section you're assigned to. If you attend a different section, please defer your seat to those officially assigned to that section, first. You may also arrange to swap sections with somebody.

  • Lab 14: Your web page, with applets
  • Lab 13: Lists in C and Java
  • Lab 12: C Pitfalls
  • Lab 11: Strings in C
  • Lab 10: JAM; for-Loops and Structures in C
  • Lab 9: Analyzing Graph-Search; Vectors
  • Lab 8: Equality; From Scheme to C
  • Lab 7: Review (Higher-Order Functions?)
  • Lab 6: Comparing Sorting Algorithms; Parsing
  • Lab 5: local; Generative Recursion
  • Lab 4: Arithmetic imprecision
  • Lab 3: Scheme: let, structures
  • Lab 2: More Scheme examples
  • Lab 1 (postscript): Getting Started with Donkey and UNIX

    A more thorough introduction to UNIX is available from Owlnet short courses or handouts (hardcopies available in Mudd). I highly recommend this, since it will make Owlnet easier for you to use throughout your stay at Rice.

    • Comp 210 homepage