This handout is also available in PDF.
Welcome to the Fall 2007 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.
This semester, we are trying a new approach to CSC151. In both sections of the course, we will be emphasizing media computation - the application of algorithmic problem solving techniques to media. We will particularly emphasize algorithms for creating and manipulating images.
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. (Followup: Evidence suggests that students in the
media computation course will need lots of window open on their screen,
so we'll probably be providing all the stuff in hardcopy, too.)
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.
Warning! We are using some cutting-edge software, which means that things will occasionally crash for no good reason.
Meets: MTuThF 10:00-10:50 a.m., Science 2417
Instructor: Samuel A. Rebelsky, Science 3824. 269-4410 (office). 236-7445 (home). Office hours Monday and Tuesday 11:00-11:50, 1:15-2:05; Friday 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: Emily Jacobson (email@example.com). Office hours TBD.
Grading (subject to change): Class participation: 15%; Regular homework: 15% Project: 15%; Exams: 45% (3 graded exams plus optional final); Best of (homework, project, some individual exam): 10%.
The final examination for this course is optional. It can be used as a makeup for one examination.
More information on grading can be found in the grading policies page.
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).
Good-Faith Grade Guarantee:
Because I realize that computer science does not
click will all
students, I reward effort as well as outcome. Hence, students who make a
good faith effort in this class will pass the class, with at least
a C+. A good-faith effort includes missing no more than two classes,
turning in every homework assignment, and spending the requisite time
on each examination.
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.
The PLT Team Languages Team (2006). DrScheme Manual. The guide to the Scheme development environment we'll be using.
Rebelsky, Samuel (2007). The CS151.02 2007F 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: Davis, Janet (2007). The CSC151.01 2007F Course Web. The course web for the other section of this class.
Optional: Springer, George and Friedman, Daniel P. (1989). Scheme and the Art of Programming. Cambridge, MA: MIT Press. The textbook that we formerly used in the class.
Wednesday, 9 August 2006 [Samuel A. Rebelsky]
Thursday, 24 August 2006 [Samuel A. Rebelsky]
Friday, 25 August 2006 [Samuel A. Rebelsky]
Saturday, 26 August 2006 [Samuel A. Rebelsky]
Sunday, 27 August 2006 [Samuel A. Rebelsky]
Friday, 19 January 2007 [Samuel A. Rebelsky]
Monday, 22 January 2007 [Samuel A. Rebelsky]
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 Wed Dec 12 20:20:31 2007.
The source to the document was last modified on Wed Dec 12 20:20:27 2007.
This document may be found at
http://creativecommons.org/licenses/by-nc/2.5/or send a letter to Creative Commons, 543 Howard Street, 5th Floor, San Francisco, California, 94105, USA.