Introduction to Computer Science (CS 117)

Winter 1997

Announcements

Problem 1 on the exam needs a correction. On the printed copy I handed out in class, there's a missing <> in the while loop. See midterm2.html for the corrected version. If you see any of your classmates, please tell them about this correction. Thanks.

To time your Merge Sort program, first compile it (e.g. gpc -o merge mergesort.p -lgraphics) and then type "time merge" at the Unix prompt. The timing output will look like "6.2u 0.3s 0:08...," where the first number (6.2 in this example) is the number of seconds the program spent doing actual computation, the second number is not relevant to our business, and the third (8 seconds in this case) is the "real time" the program took--that is, the time you spent waiting for the program to run. For your timing purposes, the first number is the important one.

Everything else

  1. Midterm 2
  2. Syllabus
  3. Assignments
  4. Labs
  5. Example Programs
  6. Carleton graphics library documentation
  7. Homework Submission Program documentation
  8. The dictionary that will be used in several assignments during the term. This file is over 600Kb long.
  9. The shorter dictionary that we turned out to need.
  10. The goriest details regarding the gpc compiler.




Jeff Ondich, Department of Mathematics and Computer Science, Carleton College, Northfield, MN 55057