LECTURES A GRATIS GLOBAL SERVICE
⌕ SEARCH GRATIS GLOBAL ↗
LECTURES
Lecture 19: Conditional Probability
SOURCE: YOUTUBE · NO TRACKING UNTIL YOU PRESS PLAY · TROUBLE PLAYING? WATCH AT THE SOURCE ↗

Lecture 19: Conditional Probability

81 MIN · EN · STATUS: [ STREAMING ]
RATE THIS
MIT · Mathematics for Computer Science · LECTURE 19

Brynmor Chapman continues MIT's 6.1200J Mathematics for Computer Science with a lecture on conditional probability. Building on the previous session's Tree Method for computing probabilities, Chapman shows how counting techniques for set sizes extend naturally into probability theory. The lecture works through how conditioning on an event reshapes a probability space, and develops the formal tools needed to reason about dependent events. As with the rest of the course, the session is chalk-and-talk style, building definitions and proofs step by step on the board, aimed at computer science students who need a rigorous grounding in discrete probability. Part of MIT OpenCourseWare's Spring 2024 offering of 6.1200J, running about 81 minutes.

At a glance

Lecture facts

Runtime compared with the other 507 Mathematics lectures
Runtime1 h 21 m
Compared with MathematicsLonger than 81%
This series

Mathematics for Computer Science

Every lecture in order, sized by its length.

  • Earlier lectures
  • This lecture
  • Still to come
Lecture 17 of 2221 h 7 m before this · 29 h 3 m in total

More from this course

12 LECTURES
Predicates, Sets, and Proofs

Predicates, Sets, and Proofs

MIT · 79 MIN
Contradiction and Induction

Contradiction and Induction

MIT · 80 MIN
State Machines

State Machines

MIT · 81 MIN
Lecture 5: Sums

Lecture 5: Sums

MIT · 82 MIN
Lecture 6: Asymptotics

Lecture 6: Asymptotics

MIT · 78 MIN
Divisibility

Divisibility

MIT · 79 MIN
Modular Arithmetic

Modular Arithmetic

MIT · 80 MIN
Lecture 10: Cryptography

Lecture 10: Cryptography

MIT · 81 MIN
Graphs and Coloring

Graphs and Coloring

MIT · 81 MIN
Lecture 12: Matching

Lecture 12: Matching

MIT · 82 MIN
Lecture 13: Connectivity and Trees

Lecture 13: Connectivity and Trees

MIT · 82 MIN
Digraphs and DAGs

Digraphs and DAGs

MIT · 79 MIN