Fundamentals of Computer Science I (CS151 2003F)

Front Door


Welcome to the Fall 2003 session of Grinnell College's CSC 151, Fundamentals of Computer Science I, which is described relatively briefly in the official blurb. My own take on this course is that we'll be starting to develop your knowledge of Computer Science and Algorithmic Problem Solving. We will be using Scheme as our development language. As in all Grinnell classes, we'll also be working on general thinking and work skills.

In an attempt to provide up-to-date information, and to spare a few trees, I am making this as much of a paperless course as I can. Hence, materials will be in a course web. You may want to read the basic instructions for using this course web.

Important Warnings

Warning! Experience shows that CSC151 exercises different parts of your brain than other courses (even than math courses). Expect some difficult times, but have confidence that you can get through them and that you'll come out of the course with much more knowledge.

Warning! Computers are sentient, stupid, and malicious. When things go wrong, don't blame yourself. Ask me or a TA for help.

Experimental Focus: Roots of Renewal

As an experiment this semester, we are going to try to think about many of the topics we discuss as we might apply them to the Roots of Renewal exhibition on campus. Think of the exhibition as a kind of client who has simply said I want you to provide interesting computer applications related to the exhibit. At times, I'll suggest applications. At other times, I will ask you to suggest applications. You may even volunteer applications.


Meets: MTuThF 2:15-3:05

Instructor: Samuel A. Rebelsky (, Science 2427. Office hours: MoTu 10:00-12:00; Fri 1:15-2:05. I also tend to follow an open door policy: Feel free to stop by when my door is open or to make an appointment for another time.

Teaching Assistant: Reese Stoltzfus,

Grading (subject to change): Class participation and quizzes: 10%; Lab write ups and homework: 30%; (3-5 graded assignments out of 6-10 total assignments); Project: 20%; Exams: 40% (3 graded exams plus optional final).

The final examination for this course is optional. It can be used as a makeup for one examination. It is likely that I will give at least one make-up homework assignment.

Late Assignments: My experience shows that students who turn in work late learn significantly less than students who turn material in on time. (I'm not sure about cause and effect.) Hence, I strongly discourage late assignments. Unless prior arrangements have been made, assignments are due within five minutes of the start of class. After that they are considered late. Late assignments are penalized one letter grade per day late (or fraction thereof).

Because I am concerned about your health and well being, I will waive the late penalty if (1) you start the assignment at least three days in advance of the due date; (2) you get to sleep by midnight the night before the assignment is due; (3) you expend a reasonable amount of effort to complete the assignment by midnight; (4) you turn in a form attesting to facts (1), (2), and 3 when the assignment is due; and (5) you talk to me ASAP about any problems you've had on the assignment.

Labs: Computer science 151 is taught in a collaborative workshop style. Each day, you'll work on laboratory problems with other students in the class. We may start each day with a short lecture/discussion and end with a reflective discussion.

Extra Credit: I offer a number of forms of extra credit during the semester. Here are some of the most common ones. Throughout the term, I may suggest other forms of extra credit.

Tutoring: The Math Lab makes tutors for 151 available at regularly scheduled times. As soon as tutors have been scheduled, I'll let you know what those times are (and post them on this page).

Optional Books and Other Readings

Kelsey, Richard, Clinger, William, and Rees, Jonathan, eds. (1998). Revised5 Report on the Algorithmic Language Scheme. February 20, 1998. The concise and complete definition of the Scheme programming language. You won't need to understand all of it, but you'll find it helpful to keep it by your side.

Rice University Programming Languages Team (1999). PLT DrScheme: Programming Environment Manual. The guide to the Scheme development environment we'll be using.

Rebelsky, Samuel (2003). The CS151 2003F Course Web. The hypertext that you are currently reading. Many of these materials (particularly those under Readings and Labs are required. You should make it a point to load the page of the day at the beginning of each class to check announcements and such.

Optional: Springer, George and Friedman, Daniel P. (1989). Scheme and the Art of Programming. Cambridge, MA: MIT Press. The textbook that we formerly used to use in the class.



Monday, 9 June 2003 [Samuel A. Rebelsky]

Thursday, 28 August 2003 [Samuel A. Rebelsky]


Disclaimer: I usually create these pages on the fly, which means that I rarely proofread them and they may contain bad grammar and incorrect details. It also means that I tend to update them regularly (see the history for more details). Feel free to contact me with any suggestions for changes.

This document was generated by Siteweaver on Tue Dec 9 13:58:38 2003.
The source to the document was last modified on Mon Sep 1 14:04:02 2003.
This document may be found at

Valid HTML 4.0 ; Valid CSS! ; Check with Bobby

Samuel A. Rebelsky,