This is my attempt at Berkeley's CS61A course based on "Structure and interpretation of computer programs".
This includes the homework and projects as well as Brian Harvey's lectures and notes at Berkeley.
Also, why Scheme and not Python? Read: http://people.eecs.berkeley.edu/~bh/proglang.html
| Progress | Lesson | Topic (Lecture Video) | Reading SICP |
|---|---|---|---|
| X | 0-1 | Functional Programming | Section 1.1 (pages 1–31) |
I'm trying to
- do readings on sicp: http://mitpress.mit.edu/sicp/
- watch video lectures: https://archive.org/details/ucberkeley-webcast-PL3E89002AA9B9879E
- read Brian Harvey's notes: https://inst.eecs.berkeley.edu//~cs61as/reader/notes.pdf#page=1
- do homework: https://inst.eecs.berkeley.edu//~cs61a/reader/nodate-hw.pdf
- do projects: https://inst.eecs.berkeley.edu//~cs61a/reader/vol1.html
- take midterms: https://inst.eecs.berkeley.edu//~cs61a/reader/vol2.html
- take final: https://inst.eecs.berkeley.edu//~cs61a/reader/vol2.html
Homepage: https://inst.eecs.berkeley.edu//~cs61a/sp11/
Index: https://inst.eecs.berkeley.edu//~cs61as/reader/