====== Assignments (CMPU-101, Fall 2011, Section 1) ======

^Number	^Topic	^Assign	^Due	^Files	^Solution ^
^1	|{{courses:cs101-201103-02:assigns:cmpu101-assignment01.pdf|Expressions and Evaluation}}	|9/9	|9/15	|None	| |
^2	|{{courses:cs101-201103-02:assigns:cmpu101-assignment02.pdf|Defining Procedures}}	|9/16	|9/22	|None| |
^3	|{{courses:cs101-201103-02:assigns:cmpu101-assignment03.pdf|Flat Recursion}}	|9/23	|9/29	|None	| |
^4	|{{courses:cs101-201103-02:assigns:cmpu101-assignment04.pdf|Deep Recursion}}	|9/30	|10/13	|None	| |
^5	|{{courses:cs101-201103-02:assigns:cmpu101-assignment05.pdf|The Accumulator Method	}}|10/7	|10/27	|None	| |
^6	|{{courses:cs101-201103-02:assigns:cmpu101-assignment06.pdf|Higher Order Procedures}}	|10/28	|11/3	|None	| |
^7	|{{courses:cs101-201103-02:assigns:cmpu101-assignment07.pdf|Dynamically Constructed Procedures}}	|11/4	|11/10	|None	| |
^8	|{{courses:cs101-201103-02:assigns:cmpu101-assignment08.pdf|Data Abstraction}}	|11/11	|11/22	|{{courses:cs101-201103-02:assigns:graphics.rkt|graphics.rkt}}	| |
^9	|{{courses:cs101-201103-02:assigns:cmpu101-assignment09.pdf|Sets and Relations}}	|11/22	|12/8	|{{courses:cs101-201103-02:assigns:sets.rkt|sets.rkt}}	| |
^10	|{{courses:cs101-201103-02:assigns:cmpu101-assignment10.pdf|Matchmaker Program}}	|12/6	|12/13	|{{courses:cs101-201103-02:assigns:dating.rkt|dating.rkt}}	| |