CS 250 Symbolic Computation
Course Syllabus -- Fall 1997

Instructor: C. Tamon
Office: SC369
Phone: x6521
E-mail: tino@sun.mcs

Lecture Hours: M,W,F, 4:00p.m.

Office Hours: M,W 2:00-4:00 p.m. and F 2:00-3:00 (tentative)

Syllabus: A course that emphasizes techniques for controlling complexity in large programming systems. Topics covered include building abstractions with procedures and with data (recursion, higher-order procedures, compound and hierarchical data) and controlling interactions (generic operations, modularity, objects, infinite data structures, self- describing data). Students will be introduced to symbolic computation using Scheme, a dialect of LISP.

Text: Abelson, Sussman, and Sussman. Structure and Interpretation of Computer Programs. MIT Press, 2nd ed., 1996.

Grades:

  • Final 40%
  • Midterm 20%
  • Assignments, Quizzes 40%

Policies: Refer to Clarkson Regulations 1997 for policies on Academic Integrity, Code of Ethics, Sanctions and other matters related to plagiarism.