MIT 6.006 Introduction to Algorithms, Spring 2020 (English)

   Tuesday, December 03, 2024   

Starting a new Lecture Notes Series on MIT 6.006 Introduction to Algorithms, Spring 2020

Youtube Lecture Playlist Credits 

Channel Name: MIT OpenCourseWare

So Let Us Start to This Journey of Learning 

MIT 6.006 Introduction to Algorithms, Spring 2020 By Lecture Notes together!

Lecture 1: 1. Algorithms and Computation

Lecture 2: 2. Data Structures and Dynamic Arrays

Lecture 3: Introduction to Algorithms - Problem Session 1: Asymptotic Behavior of Functions and Double-ended...

Lecture 4: 3. Sets and Sorting

Lecture 5: 4. Hashing

Lecture 6: Problem Session 2 (MIT 6.006 Introduction to Algorithms, Spring 2020)

Lecture 7: 5. Linear Sorting

Lecture 8: Problem Session 3

Lecture 9: 6. Binary Trees, Part 1

Lecture 10: 7. Binary Trees, Part 2: AVL

Lecture 11: Problem Session 4

Lecture 12: 8. Binary Heaps

Lecture 13: 9. Breadth-First Search

Lecture 14: Quiz 1 review

Lecture 15: 10. Depth-First Search

Lecture 16: 11. Weighted Shortest Paths

Lecture 17: Problem Session 5

Lecture 18: 12. Bellman-Ford

Lecture 19: 13. Dijkstra

Lecture 20: Problem Session 7

Lecture 21: 14. APSP and Johnson

Lecture 22: Quiz 2 Review

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

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

Lecture 25: Problem Session 8

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

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

Lecture 28: 19. Complexity

Lecture 29: Problem Session 9

Lecture 30: Quiz 3 Review

Lecture 31: 20. Course Review

Lecture 32: 21. Algorithms—Next Steps