CS 135: Designing Functional Programs


The weekly tutorials for CS 135 are designed to reinforce concepts introduced in lecture, as well as give extra guidance in preparation for assignments and exams. The format will be more interactive than lectures in order to provide a more dynamic learning environment.

The outline of each week's tutorial will be posted here each week prior to the first tutorials on Wednesday morning, and solutions will be posted on Friday afternoons. Any questions or issues can be directed to the course account or to Dan Roche directly.

Tutorial 12: Working with unknown functions (November 28-30, 2007)

Tutorial 11: Harvesting E-Mail Addresses and Other Evil Things (November 21-23, 2007)

Tutorial 10: Lots of Math (November 14-16, 2007)

Tutorial 9: Lexical Lessons and Family Fun (November 7-9, 2007)

Tutorial 8: Polynomials are the coolest! (October 31-November 2, 2007)

Tutorial 7: Trees and Mutually Recursive Data (October 24-26, 2007)

Tutorial 6: Recursion, Lists, and Tally Sets (October 17-19, 2007)

Tutorial 5: Lists and Sports Teams (October 10-12, 2007)

Tutorial 4: Scintacks and Some Antics (Syntax and Semantics) (October 3-5, 2007)

Tutorial 3: Structs and Symbols and Predicates (oh my!) (September 26-28, 2007)

Tutorial 2: Creating Functions using the Design Recipe (September 19-21, 2007)

Tutorial 1: Introduction (September 12-14, 2007)

This file generated Monday, December 17th, 2007 using PLT Scheme and WebIt!