Please see Instructor and TA contact information.
The following textbook is optional. It is available online at The Scheme Programming Language
The course requirements consist of class attendance, (more-or-less) weekly programming assignments in Scheme and occasional written homework, two in-class exams, and a *final exam* during the final exam period. (Namely: Final exam scheduled (Group 33) 12/17/2010 F 9:00.) Plan on spending between 6-8 hours per week on the course outside of class. The programming assignments are an integral part of the course.
Please try not to leave the homework to the last minute. You will be more efficient, learn more, have more chance to get help, and generally be calmer and happier if you do the associated reading first and start the programming or other problems early.
The final grade in the course will be based on class participation, your performance on the programming assignments and other homework, and the three exams. The weighting of these components will be discussed in class.
Late work without a Dean's excuse will be assessed a penalty of 5 points per day, based on the day and time recorded by the electronic submit program. At the end of term, up to 25 points will be deducted from the total lateness penalties your homework has accrued. If you have a Dean's excuse, making up missed work may involve alternative assignments, at the discretion of the instructor; please check with the instructor in this case.
Unless otherwise specified, the homework assignments are your individual responsibility. Plagiarism is a violation of University rules and will not be tolerated. You must neither copy work from others nor allow your own work to be copied.
You are encouraged to ask others for help with the computers and Unix, with questions about Scheme, general questions about the concepts and material of the course, or with casual questions about your program, but if you need more extensive help with a program or other assignment, please ask a TA or the instructor for assistance. Working in groups to solve homework problems is not permitted in this course. Please talk to the instructor if you have any questions about this policy.
Please see the course webpage for lecture notes from Fall 2002 and lecture summaries from Fall 2007 (in reverse chronological order) for an indication of the topics covered by the course. This year's coverage may differ somewhat in coverage, order and emphasis.