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

Lecture 21: Random Variables

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

MIT's 6.1200J Mathematics for Computer Science, taught by Brynmor Chapman, devotes this session to random variables and the ways of describing their probability distributions. Chapman develops the probability mass function and the cumulative distribution function as two equivalent tools for capturing how a random variable behaves, working through their definitions, properties, and the relationship between them. The lecture builds on the course's earlier probability material, part of the discrete mathematics sequence MIT designed for computer science students, and sets up the machinery needed for later topics like expectation and variance. Runtime is 71 minutes, delivered in MIT's standard lecture hall format with blackboard derivations and worked examples, consistent with the rest of the OpenCourseWare 6.1200J series from Spring 2024.

At a glance

Lecture facts

Runtime compared with the other 507 Mathematics lectures
Runtime1 h 11 m
Compared with MathematicsShorter than 51%
This series

Mathematics for Computer Science

Every lecture in order, sized by its length.

  • Earlier lectures
  • This lecture
  • Still to come
Lecture 19 of 2223 h 50 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