Syllabus and general information for MCS-178: Introduction to Computer Science II (Fall 2000)

Overview

In MCS-178 we continue exploring the perspectives and methods of computer science, particularly abstraction. We'll first confront language issues by investigating how one might write and modify a Scheme system in Scheme, a so-called meta-circular evaluator. We'll next consider the notion of computations with changing state by looking "under the hood" at computers. We'll extend this notion of state into other areas, such as the use of state to construct more efficient computational processes than otherwise, and the use of object-based and object-oriented programming to model systems of objects with changing state. Finally, at the end of the semester we'll see how object-oriented programming plays out in a second programming language (Java) and take a brief look at its use in writing event-driven and concurrent programs (those that behave in response to user actions and those that do more than one thing at a time).

Office hours

I will be available in my office (OHS 303) 2:30-3:20 Tuesdays, 10:30-11:20 Wednesdays, 9:00-9:50 Thursdays, 10:30-11:20 Fridays, and by appointment. Or try your luck: just stop by and see whether my door is open. However, I will have no office hours the week of September 18-22 (sorry). You may send me electronic mail at max@gustavus.edu or call me at extension 7466. I'll try to put any updates to my office hours on my web page, so check there if in doubt.

World Wide Web

All course materials will be available through my World Wide Web page. The URL for this course is http://www.gustavus.edu/~mc28/. After this syllabus I will give hardcopy handouts only to those students who want them.

Prerequisites

The normal prerequisite is MCS-177 (or MC27), but Karl Knight's FT01 from Fall of 1995, 1996, or 1997 together with his J-term course from 1996 or 1998 or Mike Hvidsten's J-term course from 1997 is also acceptable.

Text and readings

The primary text for the course will be Concrete Abstractions: An Introduction to Computer Science by Max Hailperin, Barbara Kaiser, and Karl Knight. We will cover chapters 10-15.

There's also an on-line Java Tutorial at http://java.sun.com/docs/books/tutorial/, and copies of Arnold and Gosling's The Java Programming Language book and Cornell and Horstmann's Core Java book in the MCS Lab monitors' room, any of which you are welcome to use as a supplement to the material on Java in our book.

Course structure

Classes will normally be on Mondays, Wednesdays, and Fridays and labs will normally be held on Tuesdays and Thursdays. However, there are a few exceptions, which are clearly marked on the class schedule. Labs will be held in the OHS 326 lab, using the Linux computers. Jeff Engelhardt will be the lab instructor.

Tests

The two intra-term exams will be conducted in OHS 317 during the evening from 7:00-8:30pm on October 10 and November 7. Please let me know as soon as possible if you won't be able to take the tests at those times. The final exam will be as scheduled by the registrar.

Attendance policy

Attendance is mandatory for all lab days. (If you turn in a lab report early, you are excused from the remaining days devoted to that lab.) I will excuse up to three absences per student, for any reason. Use yours wisely. If you exceed this allowance, I may reduce your course grade by one letter grade.

With regard to the class days, you are responsible for all course material, whether or not you are present when it was covered or distributed.

Honor

Students are encouraged to discuss the course, including issues raised by the assignments. However, the solutions to assignments should be individual original work unless otherwise specified. If an assignment makes you realize you don't understand the material, ask a fellow student a question designed to improve your understanding, not one designed to get the assignment done. To do otherwise is to cheat yourself out of understanding, as well as to be intolerably dishonorable.

Any substantive contribution to your solution by another person or taken from a publication should be properly acknowledged in writing. Failure to do so is plagiarism and will necessitate disciplinary action.

The same standards regarding plagiarism apply to team projects as to the work of individuals, except that the author is now the entire team rather than an individual. Anything taken from a source outside the team should be be properly cited.

One additional issue that arises from the team authorship of project reports is that all team members must stand behind all reports bearing their names. All team members have quality assurance responsibility for the entire project. If there is irreconcilable disagreement within the team it is necessary to indicate as much in the reports; this can be in the form of a "minority opinion" or "dissenting opinion" section where appropriate.

Late assignments

All homework and lab assignments are due at the beginning of class on the day indicated. Late assignments will be penalized by one "grade notch" (such as A to A- or A- to B+) for each weekday late or fraction thereof. However, no late assignments will be accepted after I've handed graded assignments back or discussed the assignment's solutions in class.

If you are too sick to complete an assignment on time, you will not be penalized. Simply write "late due to illness" at the top of the assignment, sign your name and hand it in. Other circumstances will be evaluated on a case-by-case basis.

Grade changes

Please point out any arithmetic or clerical error I make in grading, and I will gladly fix it. You may also request reconsideration if I have been especially unjust.

Grading

I will provide you with a grade on each homework and lab assignment and on each test, in addition to the mid-term and final grades, so that you may keep track of your performance. As a guideline, the components will contribute in the following proportion to the final grade: However, I reserve the right to subjectively adjust your final grade. Please see me if you have any question how you stand. Class participation is not graded; however, it allows you to find and repair the gaps in your understanding before doing the homework or exam, and thus can dramatically improve your grade.

Style guidelines

All homework and lab reports should be readily readable, and should not presuppose that I already know what you are trying to say. In particular: For a more detailed set of guidelines, David Wolfe prepared the document "Suggestions for Clear Lab Reports in Computer Science Courses". I recommend that you look at this document and, if you have questions about lab write-ups, ask your lab instructor.

Accessibility

Please contact me immediately if you have a learning or physical disability requiring accommodation.

Syllabus

When a reading is indicated as going to a particular page number, it means up to the heading on that page. The same section number on the next class day then indicates to finish the section.

This is my best guess as to the rate at which we will cover material. However, don't be shocked if I have to pass out one or more revised syllabi.
DateReadingTopicDue
9/610.1-10.2EBNF
9/710.3Micro-Scheme (class instead of lab)
9/8More on Micro-Scheme

9/1110.4Global definitions: Mini-Scheme
9/12Lab 1: Extending evaluators
9/1310.5Adding explanatory output
9/14Lab 1 (continued)
9/15More on explanatory output

9/1811.1-11.2The SLIM architectureHW 1
9/19Lab 1 (continued)
9/2011.3SLIM's instruction set
9/21Lab 1 (concludes)
9/22No class

9/2511.4Iteration in assembly languageLab 1
9/26Lab 2: Assembly language programming
9/2711.5Recursion in assembly language
9/28Lab 2 (continued)
9/29More on assembly programming

10/211.6Memory in Scheme: vectors
10/5Lab 2 (concludes)
10/6Review; catch-upHW 2

10/912.1-12.2Revisiting tree recursionLab 2
10/10Test 1, OHS 317, 7:00-8:30pm; no lab
10/1112.3Memoization
10/12Lab 3: Formatting paragraphs
10/1312.4Dynamic programming

10/1612.5Comparing memoization and dynamic programming
10/17Lab 3 (continued)
10/18More on memoization and dynamic programmingHW 3
10/19Lab 3 (concludes)

10/2413.1-13.2Arithmetic expressions revisited (class instad of lab)Lab 3
10/2513.3RA-stacks and rep. invariants
10/26Lab 4: Robots
10/27More on RA-stacks and rep. invariants

10/3013.4Queues
10/31Lab 4 (continued)
11/113.5Red-black treesHW 4
11/2Lab 4 (concludes)
11/313.6Dictionaries

11/6Review; catch-upLab 4
11/7Lab 5: Dictionaries; Test 2, OHS 317, 7:00-8:30pm
11/814.1-14.2Object-oriented programming
11/9Lab 5 (continued)
11/10More on object-oriented programming

11/1314.3Extensions/variations on compu-duds
11/14Lab 5 (concludes)
11/1514.5The Land of GackLab 5
11/16Lab 6: Adventures in the Imaginary Land of Gack
11/1714.4-p. 529Implementing object-oriented programming

11/2014.4More on implementation of o-o programmingHW 5
11/21Lab 6 (continued)
11/22Lab 6 (continued) (lab instead of class)

11/2715.1-15.2Java
11/28Lab 6 (concludes)
11/29More on JavaLab 6
11/30Lab 7: Java and Concurrency
12/115.3Event-driven GUI programming in Java

12/4More on event-driven GUI programming
12/5Lab 7 (continued)
12/615.4Concurrency
12/7Lab 7 (continued)
12/8More on concurrency

12/11Catch-upHW 6
12/12Lab 7 (concludes)
12/13Review and evaluationLab 7


Course web site: http://www.gustavus.edu/~mc28/
Instructor: Max Hailperin <max@gustavus.edu>
Lab instructor: Jeff Engelhardt <jengelha@gustavus.edu>