CS 61A: Structure and Interpretation of Computer Programs

Week	Date	Lecture	Textbook	Handout
1	Mon 1/21	No Lecture: MLK
	Wed 1/23	Functions 01.py	Ch. 1.1 Ch. 1.2	Disc 00: Getting Started
	Fri 1/25	Names	Ch. 1.3 Ch. 1.4
2	Mon 1/28	Control	Ch. 1.5
	Wed 1/30	Higher-Order Functions	Ch. 1.6
	Fri 2/1	Environments
3	Mon 2/4	Iteration	Ch. 2.3
	Wed 2/6	Function Examples 1
	Fri 2/8	Function Examples 2
4	Mon 2/11	Recursion Midterm 1 (time unconfirmed)	Ch. 1.7
	Wed 2/13	Tree Recursion	Ch. 1.7
	Fri 2/15	Data Abstraction	Ch. 2.1 Ch. 2.2
5	Mon 2/18	No Lecture: Presidents' Day
	Wed 2/20	Containers	Ch. 2.3
	Fri 2/22	Trees	Ch. 2.3
6	Mon 2/25	Mutable Values	Ch. 2.4
	Wed 2/27	Mutable Functions	Ch. 2.4
	Fri 3/1	Objects	Ch. 2.5
7	Mon 3/4	Inheritance	Ch. 2.5
	Wed 3/6	Representation	Ch. 2.7
	Fri 3/8	Growth	Ch. 2.8
8	Mon 3/11	Composition	Ch. 2.9
	Wed 3/13	Ordered Sets	Ch. 2.9
	Fri 3/15	Tree Sets	Ch. 2.9
9	Mon 3/18	Data Examples
	Wed 3/20	Final Examples Midterm 2 (time unconfirmed)
	Fri 3/22	Users
10	Mon 3/25	No Lecture: Spring Break
	Wed 3/27	No Lecture: Spring Break
	Fri 3/29	No Lecture: Spring Break
11	Mon 4/1	Scheme	Ch. 3.1 Ch. 3.2
	Wed 4/3	Exceptions	Ch. 3.3
	Fri 4/5	Calculator	Ch. 3.4
12	Mon 4/8	Interpreters	Ch. 3.5
	Wed 4/10	Tail Calls	Ch. 3.5
	Fri 4/12	Macros	Ch. 3.5
13	Mon 4/15	Iterators	Ch. 4.2
	Wed 4/17	Streams
	Fri 4/19	Declarative Programming	Ch. 4.3
14	Mon 4/22	Tables	Ch. 4.3
	Wed 4/24	Aggregation	Ch. 4.3
	Fri 4/26	Databases	Ch. 4.3
15	Mon 4/29	Distributed Computing	Ch. 4.6
	Wed 5/1	Social Implications
	Fri 5/3	Conclusion
16	Tue 5/14	Final (11:30-2:30 PM)