# CS70 Discrete Math and Probability Theory - Satish Rao and Babak Ayazifar - 2021 Fall

Those are note archives as well as very well-structured final review docs I made for my self. I put it here so that you can study it and also I will be able to review it later. So if you found this useful, make sure you star my repo

## Resource List

- Final Cheatsheet
- Something to complain about: Before I took my CS70 final the calnet login service crashed because of a connection issue to Duo Mobile Servers so I wasn’t able to print this out and I had to take the CS70 Final exam with nothing but my CS61C scratch paper. I am still happy that I got 1 SD above the mean though.

- Annotated Notes
- Note 0 - Sets and Mathematical Notation
- Note 1 - Propositional Logic
- Note 2 - Proofs
- Note 3 - Induction
- Note 4 - Stable Matching
- Note 5 - Graph Theory
- Note 6 - Modular Arithmetic
- Note 7 - RSA
- Note 8 - Polynomials (over a finite field)
- Note 9 - Error Correcting Code(Reed-Solomon Codes)
- Note 10 - Counting
- Note 11 - Countability
- Note 12 - Computability
- Note 13 - Probability
- Note 14 - Conditional Probability
- Note 15- Random Variables
- Note 16 - Variance and Covariance
- Note 17 - Concentration Inequalities and Law of Large Numbers
- Note 18 - Three Killer Applications - Hashing, Collecting, Load Balancing - Not in scope for FA21
- Note 19 - Geometric and Poisson Distribution
- Note 20 - Estimation
- Note 21 - Continuous Probability

- Videos