MIT 6.006 Introduction to Algorithms, Spring 2020
4.0
(4)
33 learners
What you'll learn
This course includes
- 35.3 hours of video
- Certificate of completion
- Access on mobile and TV
Course content
1 modules • 32 lessons • 35.3 hours of video
MIT 6.006 Introduction to Algorithms, Spring 2020
32 lessons
• 35.3 hours
MIT 6.006 Introduction to Algorithms, Spring 2020
32 lessons
• 35.3 hours
- 1. Algorithms and Computation 45:39
- 2. Data Structures and Dynamic Arrays 50:18
- Introduction to Algorithms - Problem Session 1: Asymptotic Behavior of Functions and Double-ended... 01:26:38
- 3. Sets and Sorting 52:56
- 4. Hashing 52:55
- Problem Session 2 (MIT 6.006 Introduction to Algorithms, Spring 2020) 01:27:40
- 5. Linear Sorting 51:57
- Problem Session 3 01:26:29
- 6. Binary Trees, Part 1 50:59
- 7. Binary Trees, Part 2: AVL 54:09
- Problem Session 4 01:29:47
- 8. Binary Heaps 50:52
- 9. Breadth-First Search 52:53
- Quiz 1 review 01:25:33
- 10. Depth-First Search 52:23
- 11. Weighted Shortest Paths 57:33
- Problem Session 5 01:28:21
- 12. Bellman-Ford 57:40
- 13. Dijkstra 57:22
- Problem Session 7 01:26:29
- 14. APSP and Johnson 56:53
- Quiz 2 Review 01:22:35
- 15. Dynamic Programming, Part 1: SRTBOT, Fib, DAGs, Bowling 57:18
- 16. Dynamic Programming, Part 2: LCS, LIS, Coins 58:44
- Problem Session 8 01:34:42
- 17. Dynamic Programming, Part 3: APSP, Parens, Piano 01:03:45
- 18. Dynamic Programming, Part 4: Rods, Subset Sum, Pseudopolynomial 01:03:45
- 19. Complexity 59:09
- Problem Session 9 01:25:29
- Quiz 3 Review 01:24:01
- 20. Course Review 55:35
- 21. Algorithms—Next Steps 59:26
Take this course with you
Download the app to continue lessons from your phone anytime.
