Computer Science 151 has at least four major goals:

1. To provide a general introduction to the fundamental ideas of computer science: algorithms, data structures, and abstraction,
2. To present problem-solving from a functional programming perspective,
3. To introduce computer programming (algorithm design, documentation, coding, testing, and debugging) in a high-level programming language, Scheme (a dialect of LISP, the dominant language used for artificial intelligence research in the United States), and
4. To illustrate important application areas of computing, such as computer simulation, structure of expert system programs, processing lab and file data, and the use of the World Wide Web.

Problem-Solving Perspectives: Computer science recognizes four problem-solving approaches as being fundamental to work in the discipline. Each approach involves a distinct way of thinking, and each is supported by a range of computer languages. These paradigms may be outlined as follows:

• Functional Paradigm:
  Supported by such languages as Scheme, LISP, ML, Miranda
• Imperative Paradigm:
  Supported by such languages as Pascal, C, FORTRAN
• Object-Oriented Paradigm:
  Supported by such languages as Smalltalk, C++, Java
• Declarative Paradigm:
  Supported by such languages as Prolog, Gödel

Since different approaches have advantages for different problems, people involved with computing should be comfortable with several of these paradigms. For this reason, CS 151 introduces one approach (functional programming with Scheme) and touches on another approach (imperative programming). CS 152 then builds on this experience by considering another approach (the object-oriented paradigm with Java) and continues a discussion of the imperative paradigm. Together, CS 151 and CS 152 provide students with multiple views of problem solving and with experience with two important programming languages.

Henry M. Walker

Office: Science 2420
Telephone: extension 4208
E-mail: walker@cs.grinnell.edu
Office hours are posted weekly on the bulletin board outside my office.
Additional hours can be scheduled by appointment.
If you wish, you may reserve a half hour meeting by signing up on the weekly schedule.

Text materials for this course are available on line:

• Clinger, William, Rees, Jonathan, et al. Revised (5) report on the algorithmic language Scheme. March 20, 1998.

• PLT. PLT DrScheme: Programming Environment Manual. November 3, 1999.

While the schedule for this course is expected to evolve, a Tentative Class Schedule is available in .dvi , postscript and pdf formats.

Also, if you are logged into the departmental network and want a copy printed, click duerer to have a copy printed on the printer duerer, and click pacioli to have a copy printed on the printer pacioli .

Course Work will involve a combination of the following activities.

• Supplemental Problems extend the range of problems considered in the course and help sharpen problem-solving skills. Since a major focus of the course involves writing programs, five of these supplemental programming problems are assigned as part of the required course work. Additional problems (numbered 7 or higher) may be done for extra credit, although extra credit may not raise a student's average on assignments above 120%.

• Hour Tests: Three hour tests are scheduled for Friday, September 15, Friday, October 13, and Wednesday, November 15.

• Exam: Following the College's published schedule, the final examination for this class is scheduled for Wednesday, December 13 at 2:00.

• Laboratories: Laboratory sessions introduce specific features of Grinnell's computing environment, highlight concepts and constructs introduced in class, allow instructor assistance in a ``hands-on'' setting, and supplement normal office hours.

  Ten labs require a formal write-up, explaining what work you have done, showing any programming you have done, indicating tests or experiments run, and giving your conclusions. Labs designated [Req] on the Tentative Class Schedule are required. Except for the first required lab (lab 3) about getting started, required lab work should follow a specified format for lab write-ups

  Labs designated [EC] may be done for extra credit. In order for extra-credit labs to provide reasonable benefit, any such lab being submitted for credit must be turned in within 2 weeks of when it is scheduled for coverage in class. As with programming assignments, extra credit may not raise a student's average on laboratories above 120%.

  Many lab activities should be done in groups of two or three, although you may work individually on labs after Lab 8. Only one write-up is expected per group.

Deadlines are shown on the Tentative Class Schedule , and work is due at the start of each class specified. A penalty of 25% per class meeting will be assessed for any assignment turned in late, even work submitted at the end of a class. However, an extension of at least one class period is automatically granted if department's computer network is down for an unscheduled period for a period of three or more hours during the week preceding the assignment. Normally, a program or laboratory write-up is due every third class meeting.

Absolute Deadline: All homework must be turned in by Friday, December 8 at 5:00 pm;
laboratory reports or programs received after that time will not be counted in the grading of the course.

The work in this course is split between individual and group work. Students are encouraged to work together on all laboratory activities. However, since a primary goal of the course is to enable students to develop their own programs, collaboration is not allowed on supplemental problems or tests. In addition, students should note the department's policy regarding the role of user-consultants for Computer Science 151 .

The final grade will be based upon each student's demonstration of her or his understanding of and facility in programming, not on the performance of the class as a whole nor on a strict percentile basis. While some flexibility may be possible in determining a final semester grade, the following percentages approximate the relative weights attached to various activities in this course.

This document is available on the World Wide Web as

     http://www.walker.cs.grinnell.edu/courses/151.fa00/index.html