MIT 6.006 Introduction to Algorithms, Fall 2011 (English)

   Friday, December 20, 2024   

Starting a new Lecture Notes Series on MIT 6.006 Introduction to Algorithms, Fall 2011

Youtube Lecture Playlist Credits 

Channel Name: MIT OpenCourseWare

So Let Us Start to This Journey of Learning 

MIT 6.006 Introduction to Algorithms, Fall 2011 By Lecture Notes together!

Lecture 1: Lecture 1: Algorithmic Thinking, Peak Finding

Lecture 2: Lecture 2: Models of Computation, Document Distance

Lecture 3: Lecture 3: Insertion Sort, Merge Sort

Lecture 4: Lecture 4: Heaps and Heap Sort

Lecture 5: Lecture 5: Binary Search Trees, BST Sort

Lecture 6: Lecture 6: AVL Trees, AVL Sort

Lecture 7: Lecture 7: Counting Sort, Radix Sort, Lower Bounds for Sorting

Lecture 8: Lecture 8: Hashing with Chaining

Lecture 9: Lecture 9: Table Doubling, Karp-Rabin

Lecture 10: Lecture 10: Open Addressing, Cryptographic Hashing

Lecture 11: Lecture 11: Integer Arithmetic, Karatsuba Multiplication

Lecture 12: Lecture 12: Square Roots, Newton's Method

Lecture 13: Lecture 13: Breadth-First Search (BFS)

Lecture 14: Lecture 14: Depth-First Search (DFS), Topological Sort

Lecture 15: Lecture 15: Single-Source Shortest Paths Problem

Lecture 16: Lecture 16: Dijkstra

Lecture 17: Lecture 17: Bellman-Ford

Lecture 18: Lecture 18: Speeding up Dijkstra

Lecture 19: Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths

Lecture 20: Lecture 20: Dynamic Programming II: Text Justification, Blackjack

Lecture 21: Lecture 21: Dynamic Programming III: Parenthesization, Edit Distance, Knapsack

Lecture 22: Lecture 22: Dynamic Programming IV: Guitar Fingering, Tetris, Super Mario Bros.

Lecture 23: Lecture 23: Computational Complexity

Lecture 24: Lecture 24: Topics in Algorithms Research

Lecture 25: Recitation 1: Asymptotic Complexity, Peak Finding

Lecture 26: Recitation 2: Python Cost Model, Document Distance

Lecture 27: Recitation 3: Document Distance, Insertion and Merge Sort

Lecture 28: Recitation 5: Recursion Trees, Binary Search Trees

Lecture 29: Recitation 6: AVL Trees

Lecture 30: Recitation 7: Comparison Sort, Counting and Radix Sort

Lecture 31: Recitation 8: Simulation Algorithms

Lecture 32: Recitation 9: Rolling Hashes, Amortized Analysis

Lecture 33: Recitation 9b: DNA Sequence Matching

Lecture 34: Recitation 10: Quiz 1 Review

Lecture 35: Recitation 11: Principles of Algorithm Design

Lecture 36: Recitation 12: Karatsuba Multiplication, Newton's Method

Lecture 37: Recitation 13: Breadth-First Search (BFS)

Lecture 38: Recitation 14: Depth-First Search (DFS)

Lecture 39: R15. Shortest Paths

Lecture 40: Recitation 16: Rubik's Cube, StarCraft Zero

Lecture 41: Recitation 18: Quiz 2 Review

Lecture 42: Recitation 19: Dynamic Programming: Crazy Eights, Shortest Path

Lecture 43: Recitation 20: Dynamic Programming: Blackjack

Lecture 44: Recitation 22: Dynamic Programming: Dance Dance Revolution

Lecture 45: Recitation 21: Dynamic Programming: Knapsack Problem

Lecture 46: Recitation 23: Computational Complexity

Lecture 47: Recitation 24: Final Exam Review