Readings

The most recently posted readings are at the top. Note that the top-most reading is not necessarily the one assigned for the next class period.

• Building Objects in Scheme (Fri May 4 & Mon May 7)
• Testing procedures (Wed May 2)
  
• Project submissions (Mon April 30 & Tuesday May 1)
  
• Merge sort (Fri April 27)
  
• Sorting (Wed April 25)
  
• Search algorithms (Mon April 23)
  
• Higher-order procedures (Wed April 18)
  
• Association lists (Tue April 17)
  
• Analyzing procedures (Mon April 16)
  
• Project ideas (Fri April 13)
  
• Elements and principles of 2D design (Wed April 11)
  
• Characters and strings (Tue April 10)
  
• Vectors (Mon April 9)
  
• Randomized drawing (Fri April 6)
  
• Trees (Tue April 3)
  
• Pairs and pair structures (Mon April 2)
  
• Geometric art (Fri March 16)
  
• Numeric recursion (Wed March 14)
  
• Local procedure bindings and recursion (Tue March 13)
  
• Verifying preconditions (Mon March 12)
• List recursion, revisited (Wed March 7)
  
• Recursion with helper procedures (Tue March 6)
  
• Recursion basics (Mon March 5)
  
• Building images by iterating over positions (Fri March 2)
  
• Building data structures with heterogeneous lists (Wed Feb 29)
  
• Naming values with local bindings (Tue Feb 28)
  
• Conditionals (Mon Feb 27)
  
• Boolean values and predicate procedures (Fri Feb 24)
  
• Iteration (Wed Feb 22)
  
• Turtle graphics (Tue Feb 21)
  
• Anonymous procedures (Wed Feb 15)
• Making and manipulating homogeneous lists (Tue Feb 14)
  
• Design & color (Mon Feb 13)
  
• Transforming images (Fri Feb 10)
  
• Transforming RGB colors (Wed Feb 8)
  
• Raster graphics and RGB colors (Tue Feb 7)
  
• Documenting procedures (Mon Feb 6)
• Writing procedures (Fri Feb 3)
  
• Drawings as values (Wed Feb 1)
  
• Basic types (Tue Jan 31)
  
• Programming with GIMP tools (Mon Jan 30)
  
• Starting Scheme (Fri Jan 27)
• The GNU Image Manipulation Program (Wed Jan 25)
  
• Parts of Algorithms (Tue Jan 24)
  
• Grinnell's Linux environment (Tue Jan 24)