Learn · Mathematics for Computer Science
Lecture 20 of 25Video Lectures1 h 23 min
Lecture 20: Independence
Prof. Tom Leighton and Dr. Marten van Dijk · Massachusetts Institute of Technology
Credits and licence
- From
- Mathematics for Computer Science, Massachusetts Institute of Technology (at MIT OpenCourseWare)
- Licence
- CC BY-NC-SA 4.0, as MIT OpenCourseWare states it. Non-commercial use only.
- Attribution
- Prof. Tom Leighton, Dr. Marten van Dijk. Mathematics for Computer Science. Fall 2010. Massachusetts Institute of Technology: MIT OpenCourseWare, https://ocw.mit.edu/. License: Creative Commons BY-NC-SA.
- Who can watch
- Tweens profiles and older. How courses are placed
All the 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