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
The final version has a better proof that Towers of Hanoi requires 2**n-1 steps to transfer n rings
Week 3: (Final version)
1 slide/page
or
4 slides/page
Week 4:
(Wednesday-Friday-Monday: 2/18-20-23)
Week 5: (
Wednesday-Friday-Monday: 2/25-27 & 3/1
)
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)
Monday-Wednesday: 3/29-3/31
,
Friday 4/2
Week 10: (Final version)
Monday-Friday: 4/5-4/9
Week 11: (Final version)
Monday-Friday: 4/12-4/16
Week 12: (Final version)
Monday-Friday: 4/19-4/23
Week 13: (Final version)
1 slide/page
or
4 slides/page
Week 14: (Preliminary version)
1 slide/page
or
4 slides/page