Welcome to the Fall 2000 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. You may also want to read the basic instructions for using this course web.
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 and malicious. When things go wrong, don't blame yourself. Ask me or a TA for help.
Meets: MTuWF 11:00-11:50 a.m.
Instructor: Samuel A. Rebelsky, Science 2427. Office hours: MW 1:15-3:00, Tu 1:30-3:00. (I tend to follow an open door policy: Feel free to stop by when my door is open)
Teaching Assistant: Jon Emmons. Hours to be determined.
Grading (subject to change): Class participation and quizzes: 10%; Lab write-ups: 30%; Other Homework: 30% (3-5 graded assignments out of 6-10 total assignments); Exams: 30% (3 graded take-home exams).
The final examination for this course is optional. It can be used as a makeup for one examination. Like the other examinations, it will be a take-home examination.
Labs: Computer science 152 is taught in 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 will occasionally give you quizzes to ensure that you're keeping up with the reading. Correct answers on the quizzes will give you some amount of extra credit.
Throughout the term, I may suggest other forms of extra credit.
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. I'll distribute copies next week.
Rice University Programming Languages Team (1999). PLT DrScheme: Programming Environment Manual. The guide to the Scheme development environment we'll be using.
Rebelsky, Samuel (2000). The CS151.02 2000F 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 used to use in the class. Still available in the bookstore at a discounted price. Certainly wouldn't hurt to have on your bookshelf.
Thursday, 24 August 2000
Tuesday, 9 January 2001
Disclaimer Often, these pages were created "on the fly" with little, if any, proofreading. Any or all of the information on the pages may be incorrect. Please contact me if you notice errors.
This page may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS151/2000F/index.html
Source text last modified Tue Jan 9 12:53:24 2001.
This page generated on Tue Jan 9 12:54:39 2001 by Siteweaver. Validate this page's HTML.
Contact our webmaster at email@example.com