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

Lecture 6: Asymptotics

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

Zachary Abel continues MIT's 6.1200J Mathematics for Computer Science with a session on asymptotic analysis. He opens by applying the summation and approximation techniques from the previous week to a classic physics problem, using it as a concrete warmup before turning to the formal machinery. The bulk of the lecture works through asymptotic notation: Big-O, Little-o, Big-Omega, and Little-omega, explaining how each bounds the growth of functions and how they relate to one another. Abel builds the definitions on the board step by step, connecting them back to the summation estimates covered earlier in the course so students see why these tools matter for analyzing algorithms. The lecture runs seventy-eight minutes as part of MIT OpenCourseWare's Spring 2024 offering of 6.1200J, a core discrete mathematics course for computer science students.

At a glance

Lecture facts

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

Mathematics for Computer Science

Every lecture in order, sized by its length.

  • Earlier lectures
  • This lecture
  • Still to come
Lecture 5 of 225 h 22 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
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
Relations and Counting

Relations and Counting

MIT · 79 MIN