CS 70 - Discrete Mathematics and Probability Theory
CS 70: Discrete Mathematics and Probability Theory (Spring 2015, UC Berkeley). Instructor: Professor Umesh Vazirani. This course discusses the foundation for many algorithms, concepts, and techniques in the field of Electrical Engineering and Computer Science. Topics covered in this course include: Logic, infinity, and induction; applications include undecidability and stable marriage problem. Modular arithmetic and GCDs; applications include primality testing and cryptography. Polynomials; examples include error correcting codes and interpolation. Probability including sample spaces, independence, random variables, law of large numbers; examples include load balancing, existence arguments, Bayesian inference.
Introduction |
References |
CS 70: Discrete Mathematics and Probability Theory, Spring 2015 Instructor: Professor Umesh Vazirani. Lecture Notes. Exams. Homework Assignments with Solutions. Discussion Handouts with Solutions. Syllabus. |