• Lab 1 in postscript or text form. Lab 1 involved describing algorithms in English and one question to let you try out C++ using the ray tracing (graphics) program.
• Lab 2 in postscript or text form. Lab 2 asked you to write up the algorithm to count using a string of digits in any base (which we restricted to 2, 3, or 4).
• Lab 3 in postscript or text form. Lab 3 uses the counting functions from lab 2 to implement an "enumerate-and-test" algorithm for testing k-colorability of a graph.
• Lab 4 in postscript or text form. Lab 4 asks you to write both recursive and iterative (loop-based) functions to play a number guessing games.
• Lab 5 in postscript or text form. Lab 5 involves a variation of the Fibonacci sequence.
• Lab 6 in postscript or text form. Lab 6 involves proofs and variations on the functions from Lab 5.
• The review for Exam 1 in postscript or text form.
• Lab 7 in postscript or text form. Lab 7 asks you to create a class to represent rational numbers.
• Lab 8 in postscript or text form. Lab 8 asks you to enhance your rational number class with more operations (including type casting), more data, and a function to assert a representation invariant.
• Lab 9 in postscript or text form. Lab 9 uses lists and streams; it asks you to write functions to find the longest word, check for a particular word, or find the set of words that exist in two lists; it also asks you to create a class to represent nodes in a graph.

• The descriptions of the final projects are also available, in postscript or text form, as usual.

This page maintained by davew@cs.haverford.edu