2
6.046J Design and Analysis of Algorithms (Spring 2015, MIT OCW). Instructors: Prof. Erik Demaine, Prof. Srinivas Devadas, and Prof. Nancy Lynch.
FREE
This course includes
Hours of videos
638 years, 9 months
Units & Quizzes
23
Unlimited Lifetime access
Access on mobile app
Certificate of Completion
This is an intermediate algorithms course with an emphasis on teaching techniques for the design and analysis of efficient algorithms, emphasizing methods of application. Topics include divide-and-conquer, randomization, dynamic programming, greedy algorithms, incremental improvement, complexity, and cryptography. (from ocw.mit.edu)
Course Currilcum
- Lecture 01 – Overview, Interval Scheduling Unlimited
- Lecture 02 – Divide and Conquer: Convex Hull, Median Finding Unlimited
- Lecture 03 – Divide and Conquer: FFT Unlimited
- Lecture 04 – Divide and Conquer: van Emde Boas Trees Unlimited
- Lecture 05 – Amortization: Amortized Analysis Unlimited
- Lecture 06 – Randomization: Matrix Multiply, Quicksort Unlimited
- Lecture 07 – Randomization: Skip Lists Unlimited
- Lecture 08 – Randomization: Universal and Perfect Hashing Unlimited
- Lecture 09 – Augmentation: Range Trees Unlimited
- Lecture 10 – Dynamic Programming: Advanced DP Unlimited
- Lecture 11 – Dynamic Programming: All-Pairs Shortest Paths Unlimited
- Lecture 12 – Greedy Algorithms: Minimum Spanning Tree Unlimited
- Lecture 13 – Incremental Improvement: Max Flow, Min Cut Unlimited
- Lecture 14 – Incremental Improvement: Matching Unlimited
- Lecture 15 – Linear Programming: LP, Reductions, Simplex Unlimited
- Lecture 16 – Complexity: P, NP, NP-completeness, Reductions Unlimited
- Lecture 17 – Complexity: Approximation Algorithms Unlimited
- Lecture 18 – Complexity: Fixed-Parameter Algorithms Unlimited
- Lecture 19 – Synchronous Distributed Algorithms: Symmetry-Breaking … Unlimited
- Lecture 20 – Asynchronous Distributed Algorithms: Shortest-Paths Spanning Trees Unlimited
- Lecture 21 – Cryptography: Hash Functions Unlimited
- Lecture 22 – Cryptography: Encryption Unlimited
- Lecture 24 – Cache-Oblivious Algorithms: Searching and Sorting Unlimited
