1
6.006 Introduction to Algorithms (Spring 2020, MIT OCW). Instructors: Prof. Erik Demaine, Dr. Jason Ku, and Prof. Justin Solomon.
FREE
This course includes
Hours of videos
888 years, 9 months
Units & Quizzes
32
Unlimited Lifetime access
Access on mobile app
Certificate of Completion
This course is an introduction to mathematical modeling of computational problems, as well as common algorithms, algorithmic paradigms, and data structures used to solve these problems. It emphasizes the relationship between algorithms and programming and introduces basic performance measures and analysis techniques for these problems. (from ocw.mit.edu)
Course Currilcum
- Lecture 01 – Algorithms and Computation Unlimited
- Lecture 02 – Data Structures and Dynamic Arrays Unlimited
- Problem Session 01 – Asymptotic Behavior of Functions and Double-ended … Unlimited
- Lecture 03 – Sets and Sorting Unlimited
- Lecture 04 – Hashing Unlimited
- Problem Session 02 – Solving Recurrences and the Master Theorem Unlimited
- Lecture 05 – Linear Sorting Unlimited
- Problem Session 03 – Drawing Pictures of Hash Tables and Reductions from Set to Sequence Unlimited
- Lecture 06 – Binary Trees, Part 1 Unlimited
- Lecture 07 – Binary Trees, Part 2 Unlimited
- Problem Session 04 – Sequence Rotations, Drawing Sequence Trees, Binary Search Unlimited
- Lecture 08 – Binary Heaps Unlimited
- Lecture 09 – Breadth-First Search Unlimited
- Quiz 01 – Review Unlimited
- Lecture 10 – Depth-First Search Unlimited
- Lecture 11 – Weighted Shortest Paths Unlimited
- Problem Session 05 – Graph Radius, Graph Schematics, Breadth and Depth-First Searches Unlimited
- Lecture 12 – Bellman-Ford Unlimited
- Problem Session 06 – Topological Ordering, DAG Relaxation, Bellman-Ford, and Python Code Unlimited
- Lecture 13 – Dijkstra Unlimited
- Problem Session 07 – Dijkstra Algorithm, Weighted Graph Radius, Weighted Ratios Unlimited
- Lecture 14 – APSP and Johnson Unlimited
- Quiz 02 – Review Unlimited
- Lecture 15 – Dynamic Programming, Part 1: SRTBOT, Fib, DAGs, Bowling Unlimited
- Lecture 16 – Dynamic Programming, Part 2: LCS, LIS, Coins Unlimited
- Problem Session 08 – Solving Recursively, O(n)-time Dynamic Programming, … Unlimited
- Lecture 17 – Dynamic Programming, Part 3: APSP, Parens, Piano Unlimited
- Lecture 18 – Dynamic Programming, Part 4: Rods, Subset Sum, Pseudo Polynomial Unlimited
- Lecture 19 – Complexity Unlimited
- Quiz 03 – Review Unlimited
- Lecture 20 – Course Review Unlimited
- Lecture 21 – Algorithms – Next Steps Unlimited
