MIT · Computer Science
6.042J Mathematics for Computer Science
Tom Leighton, Marten van Dijk · 2010 · 25 free video lectures
This course covers elementary discrete mathematics for computer science and engineering. It emphasizes mathematical definitions and proofs as well as applicable methods. Topics include formal logic notation, proof methods; induction, well-ordering; sets, relations; elementary graph theory; integer…
▶ Play on Open Lecture HallCourse page ↗
Lectures
- Lecture 1: introduction and proofs
- Lecture 2: induction
- Lecture 3: strong induction
- Lecture 4: number theory i
- Lecture 5: number theory ii
- Lecture 6: graph theory and coloring
- Lecture 7: matching problems
- Lecture 8: graph theory ii minimum spanning trees
- Lecture 9: communication networks
- Lecture 10: graph theory iii
- Lecture 11: relations partial orders and scheduling
- Lecture 12: sums
- Lecture 13: sums and asymptotics
- Lecture 14: divide and conquer recurrences
- Lecture 15: linear recurrences
- Lecture 16: counting rules i
- Lecture 17: counting rules ii
- Lecture 18: probability introduction
- Lecture 19: conditional probability
- Lecture 20: independence
- Lecture 21: random variables
- Lecture 22: expectation i
- Lecture 23: expectation ii
- Lecture 24: large deviations
- Lecture 25: random walks
From MIT OpenCourseWare · CC BY-NC-SA 4.0. More from MIT.
Open Lecture Hall is free, with no ads and no sign-up. It is not run by or connected to any university; the lectures are the universities' own free recordings, played from where they host them. About & rights