MIT data structure and algorithms 2015
5.0
(2)
26 learners
What you'll learn
This course includes
- 38.3 hours of video
- Certificate of completion
- Access on mobile and TV
Course content
1 modules • 33 lessons • 38.3 hours of video
MIT data structure and algorithms 2015
33 lessons
• 38.3 hours
MIT data structure and algorithms 2015
33 lessons
• 38.3 hours
- 1. Course Overview, Interval Scheduling 01:23:35
- 2. Divide & Conquer: Convex Hull, Median Finding 01:20:35
- R1. Matrix Multiplication and the Master Theorem 53:46
- 3. Divide & Conquer: FFT 01:20:52
- R2. 2-3 Trees and B-Trees 30:45
- 4. Divide & Conquer: van Emde Boas Trees 01:20:15
- 5. Amortization: Amortized Analysis 01:15:53
- 6. Randomization: Matrix Multiply, Quicksort 01:21:52
- R4. Randomized Select and Randomized Quicksort 39:30
- 7. Randomization: Skip Lists 01:20:56
- 8. Randomization: Universal & Perfect Hashing 01:21:51
- R5. Dynamic Programming 52:03
- 9. Augmentation: Range Trees 01:24:34
- 10. Dynamic Programming: Advanced DP 01:20:08
- 11. Dynamic Programming: All-Pairs Shortest Paths 01:21:49
- 12. Greedy Algorithms: Minimum Spanning Tree 01:22:10
- R6. Greedy Algorithms 22:24
- 13. Incremental Improvement: Max Flow, Min Cut 01:22:58
- 14. Incremental Improvement: Matching 01:22:32
- R7. Network Flow and Matching 51:12
- 15. Linear Programming: LP, reductions, Simplex 01:22:27
- 16. Complexity: P, NP, NP-completeness, Reductions 01:25:25
- R8. NP-Complete Problems 45:47
- 17. Complexity: Approximation Algorithms 01:21:08
- 18. Complexity: Fixed-Parameter Algorithms 01:17:43
- R9. Approximation Algorithms: Traveling Salesman Problem 31:59
- 19. Synchronous Distributed Algorithms: Symmetry-Breaking. Shortest-Paths Spanning Trees 01:17:34
- R10. Distributed Algorithms 50:19
- 21. Cryptography: Hash Functions 01:22:01
- 22. Cryptography: Encryption 01:24:15
- R11. Cryptography: More Primitives 49:30
- 23. Cache-Oblivious Algorithms: Medians & Matrices 01:20:28
- 24. Cache-Oblivious Algorithms: Searching & Sorting 01:17:41
