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

  1. Lecture 1: introduction and proofs
  2. Lecture 2: induction
  3. Lecture 3: strong induction
  4. Lecture 4: number theory i
  5. Lecture 5: number theory ii
  6. Lecture 6: graph theory and coloring
  7. Lecture 7: matching problems
  8. Lecture 8: graph theory ii minimum spanning trees
  9. Lecture 9: communication networks
  10. Lecture 10: graph theory iii
  11. Lecture 11: relations partial orders and scheduling
  12. Lecture 12: sums
  13. Lecture 13: sums and asymptotics
  14. Lecture 14: divide and conquer recurrences
  15. Lecture 15: linear recurrences
  16. Lecture 16: counting rules i
  17. Lecture 17: counting rules ii
  18. Lecture 18: probability introduction
  19. Lecture 19: conditional probability
  20. Lecture 20: independence
  21. Lecture 21: random variables
  22. Lecture 22: expectation i
  23. Lecture 23: expectation ii
  24. Lecture 24: large deviations
  25. 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