CSG107 Syllabus, Spring 2009
(Tentative)

This syllabus is approximate.

Date Lecture Topic Readings Problem Set Due
1/5 Designing functions for finite data HtDP: Part I, Intermezzo 1 Set 1 1/14
1/12 Designing functions for arbitrarily large data (1) HtDP: Part II, Intermezzos 2, 3 Set 2 1/28
1/19 No Lecture or Lab this week      
1/26 Designing functions for arbitrarily large data (2) HtDP: Part III Set 3 2/4
2/2 Designing abstractions with first-class functions HtDP: Part IV, Intermezzo 4 Set 4 2/11
2/9 Designing functions with accumulators HtDP: Part VI, Intermezzo 6 Set 5 2/18
2/16 Presidents' Day: No lecture; labs will meet      
2/23 Designing functions with generative recursion HtDP: Part V, Intermezzo 5 Set 6 3/11
3/2 Spring break: no lecture or labs this week      
3/9 Choosing a design strategy HtDP: Parts I-VI Set 7 3/18
3/16 Designing Classes HtDC: Part I, Intermezzo 1 Set 8 3/25
3/23 Designing Interfaces HtDC: Part II, Intermezzo 2 Set 9 4/2
3/30 Abstract Classes HtDC: Part III, Intermezzo 3 Set 10  
4/6 Stateful Classes HtDC: Part IV, Intermezzo 4 Set11  
4/13 Last Week of Classes      

Warning: This schedule is subject to change due to weather. (It's snowed in April in the past!) If we miss a lecture due to snow, other lectures and the midterm may change dates accordingly.

Examples from lectures are available via svn.


Mitchell Wand
College of Computer and Information Science, Northeastern University
360 Huntington Avenue #202WVH,
Boston, MA 02115
Internet: wand @ ccs.neu.edu
Phone: (617) 373-2072 / Fax: (617) 373-5121

Last modified: Wed Feb 04 22:16:18 2009