Computer Science 280: Lecture Notes
Note that the final version of the notes may differ from the
preliminary version. I correct typos and add more details.
- Week 1: (Final version) 1 slide/page or
4 slides/page
- Week 2: (Final version) 1 slide/page or
4 slides/page
- Week 3: (Final version) 1 slide/page or
4 slides/page
- Week 4: (Final version) 1 slide/page or
4 slides/page
- Week 5: (Final version) 1 slide/page or
4 slides/page
- Week 6: (Final version) 1 slide/page or
4 slides/page
- Week 7: (Final version) 1 slide/page or
4 slides/page
- Week 8: (Final version) 1 slide/page or
4 slides/page
- Week 9: (Final version) 1 slide/page or
4 slides/page
- Week 10: (Final version) 1 slide/page or
4 slides/page
- Slides 1, 4, 5, 8, 10, 14, 15, and 16 in the Week 10 notes are
actually material we covered in Week 9. I took the material out of the
Week 9 notes and put them in this week's notes since I prefer this
reorganization. I'll talk about them briefly again, since I think the
material is important, and it helps to see it in this context.
- Week 11: (Final version) 1 slide/page
- I can't do 4 slides/page, apparently because of the figures
- Note that the preliminary version had slides on a randomized
algorithm for finding the median. I didn't cover it, but I'll do it
later in the course
- Week 12: (Final version) 1
slide/page
or 4 slides/page
- I cut some material on natural deduction that was in the
preliminary version, and added more discussion on complete
axiomatizations (which I also talked about in class on Friday).
- Week 13: (Final version) 1
slide/page
or 4 slides/page
- Week 14: I discussed some material in the Week 11 notes on
probabilistic algorithms (in particular, an algorithm for median
finding) and the Second Ace and Monty Hall Puzzles (see the Week 9
notes). All I'm posting here is the little bit of material on
bureaucracy and Ten Powerful Ideas, in
1 slide/page
or 4 slides/page format.