Lecture Videos

Due to COVID-19, in-person classes were suspended mid-way through the semester. Lectures continued to be recorded in a traditional style.

Subscribe to this collection
Lecture 1: Algorithms and Computation

Lecture 1: Algorithms and Computation

Lecture 2: Data Structures and Dynamic Arrays

Lecture 2: Data Structures and Dynamic Arrays

Problem Session 1

Problem Session 1

Lecture 3: Sets and Sorting

Lecture 3: Sets and Sorting

Lecture 4: Hashing

Lecture 4: Hashing

Problem Session 2

Problem Session 2

Lecture 5: Linear Sorting

Lecture 5: Linear Sorting

Problem Session 3

Problem Session 3

Lecture 6: Binary Trees, Part 1

Lecture 6: Binary Trees, Part 1

Lecture 7: Binary Trees, Part 2: AVL

Lecture 7: Binary Trees, Part 2: AVL

Problem Session 4

Problem Session 4

Lecture 8: Binary Heaps

Lecture 8: Binary Heaps

Lecture 9: Breadth-First Search

Lecture 9: Breadth-First Search

Quiz 1 Review

Quiz 1 Review

Lecture 10: Depth-First Search

Lecture 10: Depth-First Search

Lecture 11: Weighted Shortest Paths

Lecture 11: Weighted Shortest Paths

Problem Session 5

Problem Session 5

Lecture 12: Bellman-Ford

Lecture 12: Bellman-Ford

Problem Session 6

Problem Session 6

Lecture 13: Dijkstra

Lecture 13: Dijkstra

Problem Session 7

Problem Session 7

Lecture 14: APSP and Johnson

Lecture 14: APSP and Johnson

Quiz 2 Review

Quiz 2 Review

Lecture 15: Dynamic Programming, Part 1: SRTBOT, Fib, DAGs, Bowling

Lecture 15: Dynamic Programming, Part 1: SRTBOT, Fib, DAGs, Bowling

Lecture 16: Dynamic Programming, Part 2: LCS, LIS, Coins

Lecture 16: Dynamic Programming, Part 2: LCS, LIS, Coins

Problem Session 8

Problem Session 8

Lecture 17: Dynamic Programming, Part 3: APSP, Parens, Piano

Lecture 17: Dynamic Programming, Part 3: APSP, Parens, Piano

Lecture 18: Dynamic Programming, Part 4: Rods, Subset Sum, Pseudopolynomial

Lecture 18: Dynamic Programming, Part 4: Rods, Subset Sum, Pseudopolynomial

Lecture 19: Complexity

Lecture 19: Complexity

Quiz 3 Review

Quiz 3 Review

Lecture 20: Course Review

Lecture 20: Course Review

Lecture 21: Algorithms—Next Steps

Lecture 21: Algorithms—Next Steps

Need help getting started? Don't show me this again

Don't show me this again

Welcome!

This is one of over 2,400 courses on OCW. Explore materials for this course in the pages linked along the left.

MIT OpenCourseWare is a free & open publication of material from thousands of MIT courses, covering the entire MIT curriculum.

No enrollment or registration. Freely browse and use OCW materials at your own pace. There's no signup, and no start or end dates.

Knowledge is your reward. Use OCW to guide your own life-long learning, or to teach others. We don't offer credit or certification for using OCW.

Made for sharing. Download files for later. Send to friends and colleagues. Modify, remix, and reuse (just remember to cite OCW as the source.)

Learn more at Get Started with MIT OpenCourseWare