MIT 6.006 Introduction to Algorithms, Fall 2011
5.0
(0)
12 learners
What you'll learn
This course includes
- 41.5 hours of video
- Certificate of completion
- Access on mobile and TV
Course content
1 modules • 47 lessons • 41.5 hours of video
MIT 6.006 Introduction to Algorithms, Fall 2011
47 lessons
• 41.5 hours
MIT 6.006 Introduction to Algorithms, Fall 2011
47 lessons
• 41.5 hours
- Lecture 1: Algorithmic Thinking, Peak Finding 53:22
- Lecture 2: Models of Computation, Document Distance 48:52
- Lecture 3: Insertion Sort, Merge Sort 51:20
- Lecture 4: Heaps and Heap Sort 52:32
- Lecture 5: Binary Search Trees, BST Sort 52:40
- Lecture 6: AVL Trees, AVL Sort 51:59
- Lecture 7: Counting Sort, Radix Sort, Lower Bounds for Sorting 52:09
- Lecture 8: Hashing with Chaining 51:16
- Lecture 9: Table Doubling, Karp-Rabin 52:47
- Lecture 10: Open Addressing, Cryptographic Hashing 50:55
- Lecture 11: Integer Arithmetic, Karatsuba Multiplication 47:24
- Lecture 12: Square Roots, Newton's Method 51:17
- Lecture 13: Breadth-First Search (BFS) 50:48
- Lecture 14: Depth-First Search (DFS), Topological Sort 50:31
- Lecture 15: Single-Source Shortest Paths Problem 53:15
- Lecture 16: Dijkstra 51:26
- Lecture 17: Bellman-Ford 48:51
- Lecture 18: Speeding up Dijkstra 53:16
- Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths 51:47
- Lecture 20: Dynamic Programming II: Text Justification, Blackjack 52:12
- Lecture 21: Dynamic Programming III: Parenthesization, Edit Distance, Knapsack 52:41
- Lecture 22: Dynamic Programming IV: Guitar Fingering, Tetris, Super Mario Bros. 49:20
- Lecture 23: Computational Complexity 51:12
- Lecture 24: Topics in Algorithms Research 46:46
- Recitation 1: Asymptotic Complexity, Peak Finding 53:50
- Recitation 2: Python Cost Model, Document Distance 52:21
- Recitation 3: Document Distance, Insertion and Merge Sort 54:10
- Recitation 5: Recursion Trees, Binary Search Trees 59:16
- Recitation 6: AVL Trees 53:28
- Recitation 7: Comparison Sort, Counting and Radix Sort 51:09
- Recitation 8: Simulation Algorithms 55:39
- Recitation 9: Rolling Hashes, Amortized Analysis 01:01:01
- Recitation 9b: DNA Sequence Matching 57:28
- Recitation 10: Quiz 1 Review 54:49
- Recitation 11: Principles of Algorithm Design 58:26
- Recitation 12: Karatsuba Multiplication, Newton's Method 53:08
- Recitation 13: Breadth-First Search (BFS) 54:53
- Recitation 14: Depth-First Search (DFS) 53:39
- R15. Shortest Paths 56:31
- Recitation 16: Rubik's Cube, StarCraft Zero 54:35
- Recitation 18: Quiz 2 Review 01:05:30
- Recitation 19: Dynamic Programming: Crazy Eights, Shortest Path 52:47
- Recitation 20: Dynamic Programming: Blackjack 52:58
- Recitation 22: Dynamic Programming: Dance Dance Revolution 53:16
- Recitation 21: Dynamic Programming: Knapsack Problem 01:09:12
- Recitation 23: Computational Complexity 47:13
- Recitation 24: Final Exam Review 51:44
Take this course with you
Download the app to continue lessons from your phone anytime.
