// the find
PKUFlyingPig/UCB-CS70
discrete mathematics and probability theory
The full set of UC Berkeley CS70 (discrete math and probability) course materials from the Fall 2020 offering: lecture notes, slides, discussion worksheets, and homeworks, each with a solution. It suits self-learners who want the course content without enrolling, and there's no code here to adopt.
- Every discussion and homework has a matching solution PDF beside it, so you can check your work without hunting for an answer key.
- The sequence runs the whole course arc, from proofs and induction through stable matching, graphs, modular arithmetic and RSA, polynomials and error-correcting codes, counting, probability, random variables, and Markov chains.
- The problem sets and worksheets are the course's own, so the difficulty comes from a university course rather than from someone summarizing it.
- Everything is a PDF with no source files, so you can't diff versions, search the text, or fix a typo without the original LaTeX. The README's own typos ('concentrain inequalities') suggest it hasn't been edited much.
- It's pinned to the 2020 fall offering. The last push was June 2022, and the README points to eecs70.org for the current course, so assignment numbers and content will drift from what Berkeley runs now.
- The README is the only index, and it groups notes by number range without saying which discussion or homework goes with which. You match them up by filename.