CS 135 Discrete Structures - Spring 2012
The Little Schemer - 4th Edition, by Daniel P. Friedman and Matthias Felleisen, ISBN 0-262-56099-2
You, your instructor, and the TA are bound by the Stevens Honor Code.
Students are responsible for reading and understanding the course policies in these web pages and for announcements made in class and in the course email list.
Use of notebook computers is mandatory in labs.
During lecture, texting and many uses of notebook computers may be distracting to the user and to others. Therefore they are disallowed during lecture. This policy is, however, open to discussion and negotiation.
The course score is a weighted average of the following categories.
Letter grades are assigned on the usual basis:
A = 90–100
B+ = 86–90
B = 80–86
C+ = 76–80
C = 70–76
D+ = 66–70
D = 60–66
F = 0–60
The instructor reserves the right to give a higher grade than your course score, if your performance on later assignments and exams is very strong.
Labs are “closed”: the assignment is given, completed, and graded during the lab session. Group work is at the discretion of the TA.
There are no make-ups for labs or exams. The only possible exceptions are in the case of death in the student’s immediate family or near-death experience of the student; advance notice is required.
There may be short, unannounced quizzes in class, which count in the “homework” grade category. The purpose is to motivate attendance and to help both you and your instructor gauge your progress. There won’t be make-ups, but in calculating your homework average we’ll adjust the score to have an effect like dropping your lowest score.
This is a course on discrete math, not on Scheme. We will use a study a small, subset of the language in order to (a) develop skill in pure functional programming and (b) focus on the math. There will be about 10 homework assignments, often involving small Scheme programs. Homework will be accepted up to 24 hours late, at a penalty of 40% grade reduction.
Except when groups are explicitly allowed, work must be done individually. You are encouraged to discuss the problems with your classmates but you must not share details of the solutions. If you are unsure whether you have shared too much, discuss the situation with the TA or instructor; it is your obligation to avoid even the appearance of cheating.
This will be revised and augmented during the semester.
About the assigned readings below: skim the readings before class, read thoroughly soon afterwords.
Sections refer to the Rosen textbook, 7th edition, unless marked LS which means The Little Schemer.
Read Rosen sects 1.1–1.3, Little Schemer chapts 1–2
Here is the first lab assignment
Read Rosen sects 1.4–1.6
Read sects 1.7–1.8
Read 2.4, 5.1
no class Mon; Tues = Mon
Read 5.3 and 3.1
Read LS chapt 5.
no class Fri
Read 4.6; Read 10.1–10.2
second midterm is Mon
last day of class is Wed
To assess student progress we focus on key skills that can be demonstrated. Here is the official list of course outcomes to be achieved by the end of the semester:
The list can also be found hereCS 135 Spring 2011 Revision: 1.2 , Date: 2012/01/17 03:23:12
This document was translated from LATEX by HEVEA.