MIT 6.046J Design and Analysis of Algorithms, Spring 2015 (English)

   Monday, December 16, 2024   

Starting a new Lecture Notes Series on MIT 6.046J Design and Analysis of Algorithms, Spring 2015

Youtube Lecture Playlist Credits 

Channel Name: MIT OpenCourseWare

So Let Us Start to This Journey of Learning 

MIT 6.046J Design and Analysis of Algorithms, Spring 2015 By Lecture Notes together!

Lecture 1: 1. Course Overview, Interval Scheduling

Lecture 2: R1. Matrix Multiplication and the Master Theorem

Lecture 3: The Calculus You Need

Lecture 4: 3. Divide & Conquer: FFT

Lecture 5: R2. 2-3 Trees and B-Trees

Lecture 6: 4. Divide & Conquer: van Emde Boas Trees

Lecture 7: 5. Amortization: Amortized Analysis

Lecture 8: 6. Randomization: Matrix Multiply, Quicksort

Lecture 9: R4. Randomized Select and Randomized Quicksort

Lecture 10: 7. Randomization: Skip Lists

Lecture 11: 8. Randomization: Universal & Perfect Hashing

Lecture 12: R5. Dynamic Programming

Lecture 13: 9. Augmentation: Range Trees

Lecture 14: 10. Dynamic Programming: Advanced DP

Lecture 15: 11. Dynamic Programming: All-Pairs Shortest Paths

Lecture 16: 12. Greedy Algorithms: Minimum Spanning Tree

Lecture 17: R6. Greedy Algorithms

Lecture 18: 13. Incremental Improvement: Max Flow, Min Cut

Lecture 19: 14. Incremental Improvement: Matching

Lecture 20: R7. Network Flow and Matching

Lecture 21: 15. Linear Programming: LP, reductions, Simplex

Lecture 22: 16. Complexity: P, NP, NP-completeness, Reductions

Lecture 23: R8. NP-Complete Problems

Lecture 24: 17. Complexity: Approximation Algorithms

Lecture 25: 18. Complexity: Fixed-Parameter Algorithms

Lecture 26: R9. Approximation Algorithms: Traveling Salesman Problem

Lecture 27: 19. Synchronous Distributed Algorithms: Symmetry-Breaking. Shortest-Paths Spanning Trees

Lecture 28: 20. Asynchronous Distributed Algorithms: Shortest-Paths Spanning Trees

Lecture 29: R10. Distributed Algorithms

Lecture 30: 21. Cryptography: Hash Functions

Lecture 31: 22. Cryptography: Encryption

Lecture 32: R11. Cryptography: More Primitives

Lecture 33: 23. Cache-Oblivious Algorithms: Medians & Matrices

Lecture 34: 24. Cache-Oblivious Algorithms: Searching & Sorting