Berkley CS 61A (Spring 2011)

This repository documents my progress in completing the CS 61A Programming course by Brian Harvey at Berkley.

Progress

Week 1

Topic: Functional programming

• Reading (Section 1.1)
• Homework (solution)
• Labs (Lab 1 solution, Lab 2 solution)
• Watch
  • Lecture 01: functional programming 1
  • Lecture 02: functional programming 2

---

Week 2

Topic: Higher-order procedures

• Reading (Section 1.3)
• Homework (solution)
• Labs (solution)
• Watch
  • Lecture 03: higher-order procedures 1
  • Lecture 04: higher-order procedures 2

---

Week 3

Topic: Recursion and iteration

• Reading (Section 1.2 through 1.2.4)
• Homework (solution)
• Labs (solution)
• Watch
  • Lecture 05: user interface -Alan Kay-
  • Lecture 06: user interface -Alan Kay-
  • Lecture 07: orders of growth
  • Lecture 08: recursion and iteration
• Project 1 (solution)

---

Week 4

Topic: Data abstraction

• Reading (Section 2.1 and Section 2.2.1)
• Homework (solution)
• Labs (solution)
• Watch
  • Lecture 09: data abstraction
  • Lecture 10: sequences
  • Lecture 11: Example: calculator
• Midterm 1 (answers)

---

Week 5

Topic: Hierarchical data

• Reading (Section 2.2.2-3 and Section 2.3.1-3)
• Homework (solution)
• Labs (solution)
• Watch
  • Lecture 12: hierarchical data
  • Lecture 13: hierarchical data
  • Lecture 14: Example: Scheme-1 interpr
• Project 2 (solution)

Note

Lecture 15 is not given due to a half-term

---

Week 6

Topic: Generic Operators

• Reading (Section 2.4 through 2.5.2)
• Homework (solution)
• Labs (solution)
• Watch
  • Lecture 16: generic operators
  • Lecture 17: generic operators

---

Week 7

Topic: Object-oriented programming

• Reading (oop_aboveline.pdf)
• Homework (solution)
• Labs (solution)
• Watch
  • Lecture 18: object-oriented programming
  • Lecture 19: object oriented programming
  • Lecture 20: object oriented programming
• Midterm 2 (answers)

---

Week 8

Topic: Assignment, state, environments

• Reading (Section 3.1, 3.2, oop_belowline.pdf)
• Homework (solution)
• Labs (solution)
• Watch
  • Lecture 21: assignment and state
  • Lecture 22: environments
  • Lecture 23: environments
• Project 3 part 1 (solution)

---

Week 9

Topic: Mutable data, vectors

• Reading (Section 3.3.1–3)
• Homework (solution)
• Labs (solution)
• Watch
  • Lecture 24: mutable data
  • Lecture 25: mutable data
  • Lecture 26: vectors
• Project 3 part 2

Note

Lecture 27-29 is not given due to spring break]

---

Week 10

Topic: client/server, concurrency

• Reading (Section 3.4)
• Homework (solution)
• Labs
• Watch
  • Lecture 30: client-server programming
  • Lecture 31: concurrency
  • Lecture 32: concurrency

---

Week 11

Topic: Streams

• Reading (3.5.1–3, 3.5.5, therac-25.pdf)
• Homework (solution)
• Labs (solution)
• Watch
  • Lecture 33: streams
  • Lecture 34: streams
  • Lecture 35: Therac-25
• Midterm 3 (answers)

---

Week 12

Topic: Metacircular evaluator

• Reading (4.1.1-6, mapreduce)
• Homework (solution)
• Labs (solution)
• Watch
  • Lecture 36: metacircular evaluator
  • Lecture 37: metacircular evaluator
  • Lecture 38: mapreduce
  • Lecture 39: mapreduce

---

Week 13

Topic: Analyzing evaluator, MapReduce

• Reading (analyzing evaluator))
• Homework (solution)
• Labs (solution)
• Watch
  • Lecture 40: analyzing evaluator

---

Week 14

Topic: lazy evaluator, nondeterministic evaluator

• Reading (4.2, 4.3)
• Homework (solution)
• Labs (solution)
• Watch
  • Lecture 41: lazy evaluator
• Project 4a (solution)

---

Week 15

Topic: Logic programming

• Reading (4.4.1-3)
• Homework (solution)
• Labs (solution)
• Watch
  • Lecture 42: logic programming
  • Lecture 43: logic programming
• Project 4b (solution)

---

Week 16

Topic: Review

• Watch
  • Lecture 44: Review
• Final exam (answers)