6.1200J Mathematics for Computer Science (Spring 2024, MIT OCW) | Computer Science

6.1200J Mathematics for Computer Science

6.1200J Mathematics for Computer Science (Spring 2024, MIT OCW). Instructors: Prof. Eric Demaine, Dr. Zachary Abel, and Dr. Brynmor Chapman. This course covers elementary discrete mathematics for science and engineering, with a focus on mathematical tools and proof techniques useful in computer science. Topics include logical notation, sets, relations, elementary graph theory, state machines and invariants, induction and proofs by contradiction, recurrences, asymptotic notation, elementary analysis of algorithms, elementary number theory and cryptography, permutations and combinations, counting tools, and discrete probability. (from ocw.mit.edu)

Predicates, Sets, and Proofs

Lecture 01 - Predicates, Sets, and Proofs

Lecture 02 - Contradiction and Induction

Lecture 03 - Casework and Strong Induction

Lecture 04 - State Machines

Lecture 05 - Sums

Lecture 06 - Asymptotics

Lecture 07 - Recurrences

Lecture 08 - Disvisibility

Lecture 09 - Modular Arithmetic

Lecture 10 - Cryptography

Lecture 11 - Graphs and Coloring

Lecture 12 - Matching

Lecture 13 - Connectivity and Trees

Lecture 14 - Digraphs and DAGs

Lecture 15 - Relations and Counting

Lecture 16 - Counting Techniques

Lecture 17 - More Counting Techniques

Lecture 18 - Probability

Lecture 19 - Conditional Probability

Lecture 20 - Independence

Lecture 21 - Random Variables

Lecture 22 - Expectation

Lecture 23 - Expectation and Variance

Lecture 24 - Large Deviations: Chebyshev and Chernov Bound, Wrap Up

References

6.1200J Mathematics for Computer Science (Spring 2024)
Instructors: Prof. Eric Demaine, Dr. Zachary Abel, and Dr. Brynmor Chapman. Lecture Notes. Readings. This course covers elementary discrete mathematics for science and engineering, with a focus on mathematical tools and proof techniques useful in computer science.