Schedule for MCS 177: Intro to CS I (Fall 2009)

Date Reading Topic Due

9/8 Project 0: Getting started
9/9 1.1-1.2 Introduction; simple expressions
9/10 Project 1: Quilting
9/11 1.2-1.3 Compound procedures; conditionals

9/14 2.1 Recursion Homework #1
9/15 Project 1 continues
9/16 2.2 Induction
9/17 Project 1 continues
9/18 2.3 Further examples

9/21 3.1 Iteration Homework #2
9/22 Project 1 continues
9/23 3.2 Invariants
9/24 Project 1 concludes
9/25 3.3 Perfect numbers, internal definitions, & let

9/28 3.4 Iterative improvement Homework #3
9/29 Special project: Card sorting (ungraded)
9/30 Review/catchup Project 1
10/1 Test #1, 7:00-8:30 pm in Olin 317 (no lab)
10/2 No class

10/5 4.1 Orders of growth
10/6 Nobel Conference (no lab)
10/7 Nobel Conference (no class)
10/8 No lab
10/9 4.1 More on orders of growth

10/12 4.3 Fractals and Tree Recursion
10/13 Project 2: Fractal curves
10/14 4.2 Digital signatures
10/15 Project 2 continues
10/16 4.2 More on digital signatures

10/19 4.2 Still more on digital signatures
10/20 Project 2 continues
10/21 5.1 Procedural parameters Homework #4
10/22 Project 2 concludes
10/23 5.3 Procedures that return procedures Project 2

10/26 Reading days (no class)
10/27 Reading days (no lab)
10/28 5.3-5.4 More on 5.3 & Error-checking procedures
10/29 Error-checking homework (#5)
10/30 6.1-6.2 Data abstraction

11/2 6.3 & 6.5 Representation and implementation & overview of Nim lab Homework #5
11/3 Project 3: Nim with strategies
11/4 6.3 More on representations and implementations
11/5 Project 3 continues
11/6 7.1 & 7.2 Lists

11/9 7.3 Basic list processing Homework #6
11/10 Project 3 continues
11/11 Review/catchup
11/12 Test #2, 7:00-8:30 pm in Olin 317 (no lab)
11/13 no class

11/16 7.4 Iterative list processing
11/17 Project 3 concludes
11/18 7.6 Overview of movie query system Project 3
11/19 Project 4: Movie query system
11/20 7.5 Tree recursion and lists

11/23 8.1 Binary search trees Homework #7
11/24 Project 4 continues
11/25 Thanksgiving break
11/26 Thanksgiving break
11/27 Thanksgiving break

11/30 8.1/8.2 Efficiency issues with binary search trees
12/1 Project 4 continues
12/2 8.2 More on efficiency issues with binary search trees
12/3 Project 4 concludes
12/4 9.1 & 9.2 Generic operations, multiple representations

12/7 9.2 & 9.4 Computer graphics and representations Project 4
12/8 Project 5: Computer graphics
12/9 9.2 & 9.4 More on computer graphics and representations Homework #8
12/10 Project 5 continues
12/11 9.3 Exploiting commonality

12/14 Review/evaluations Homework #9
12/15 Project 5 concludes
12/16 No class (reading day): project due at 10:00 a.m. in my office Project 5