MIT 6.006 Introduction to Algorithms, Spring 2020

Name: MIT 6.006 Introduction to Algorithms, Spring 2020
Availability: InStock
Rating: 4 (4 reviews)

4.0 (4)

33 learners

What you'll learn

1 modules • 32 lessons • 35.3 hours of video

32 lessons • 35.3 hours

1. Algorithms and Computation45:39
2. Data Structures and Dynamic Arrays50:18
Introduction to Algorithms - Problem Session 1: Asymptotic Behavior of Functions and Double-ended...01:26:38
3. Sets and Sorting52:56
4. Hashing52:55
Problem Session 2 (MIT 6.006 Introduction to Algorithms, Spring 2020)01:27:40
5. Linear Sorting51:57
Problem Session 301:26:29
6. Binary Trees, Part 150:59
7. Binary Trees, Part 2: AVL54:09
Problem Session 401:29:47
8. Binary Heaps50:52
9. Breadth-First Search52:53
Quiz 1 review01:25:33
10. Depth-First Search52:23
11. Weighted Shortest Paths57:33
Problem Session 501:28:21
12. Bellman-Ford57:40
13. Dijkstra57:22
Problem Session 701:26:29
14. APSP and Johnson56:53
Quiz 2 Review01:22:35
15. Dynamic Programming, Part 1: SRTBOT, Fib, DAGs, Bowling57:18
16. Dynamic Programming, Part 2: LCS, LIS, Coins58:44
Problem Session 801:34:42
17. Dynamic Programming, Part 3: APSP, Parens, Piano01:03:45
18. Dynamic Programming, Part 4: Rods, Subset Sum, Pseudopolynomial01:03:45
19. Complexity59:09
Problem Session 901:25:29
Quiz 3 Review01:24:01
20. Course Review55:35
21. Algorithms—Next Steps59:26