MCS-177 Introduction to Computer Science I, Fall 2007
Code from class
Chapter 1
line-length
Chapter 2
polygon numbers
digit procedures for 9/14
Chapter 3
iterative versions of procedures
using invariants
iterative version of presents-through-day
lets and internal-definitions
square root of 2
Chapter 4
mod-expt
Chapter 5
procedures as parameters
Chapter 6
game-states
Chapter 7
basic list stuff
cdring down and consing up
reversing a list
Chapter 8
arithmetic expression evaluator
Chapter 9
sequences
Useful Links
Supporting Materials
for our textbook, including Scheme implementations for many platforms
Documentation for the Scheme programming language
The graphics tool for DrScheme