Lecture

Right Arrow

SEARCH COURSES / LECTURES

Left Arrow

Introduction to Algorithms, Fall 2011 (M-I-T)

(47 Lectures Available)

S# Lecture Course Institute Instructor Discipline
1
  • 1. Algorithmic Thinking, Peak Finding (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Srini Devadas Applied Sciences
2
  • 10. Open Addressing, Cryptographic Hashing (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Srini Devadas Applied Sciences
3
  • 11. Integer Arithmetic, Karatsuba Multiplication (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Srini Devadas Applied Sciences
4
  • 12. Square Roots, Newton's Method (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Srini Devadas Applied Sciences
5
  • 13. Breadth-First Search (BFS) (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Srini Devadas Applied Sciences
6
  • 14. Depth-First Search (DFS), Topological Sort (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Srini Devadas Applied Sciences
7
  • 15. Single-Source Shortest Paths Problem (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Srini Devadas Applied Sciences
8
  • 16. Dijkstra (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Srini Devadas Applied Sciences
9
  • 17. Bellman-Ford (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Srini Devadas Applied Sciences
10
  • 18. Speeding up Dijkstra (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Srini Devadas Applied Sciences
11
  • 19. Dynamic Programming I: Fibonacci, Shortest Paths (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Srini Devadas Applied Sciences
12
  • 2. Models of Computation, Document Distance (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Srini Devadas Applied Sciences
13
  • 20. Dynamic Programming II: Text Justification, Blackjack (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Srini Devadas Applied Sciences
14
  • 21. DP III: Parenthesization, Edit Distance, Knapsack (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Srini Devadas Applied Sciences
15
  • 22. DP IV: Guitar Fingering, Tetris, Super Mario Bros. (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Srini Devadas Applied Sciences
16
  • 23. Computational Complexity (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Srini Devadas Applied Sciences
17
  • 24. Topics in Algorithms Research (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Srini Devadas Applied Sciences
18
  • 3. Insertion Sort, Merge Sort (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Srini Devadas Applied Sciences
19
  • 4. Heaps and Heap Sort (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Srini Devadas Applied Sciences
20
  • 5. Binary Search Trees, BST Sort (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Srini Devadas Applied Sciences
21
  • 6. AVL Trees, AVL Sort (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Srini Devadas Applied Sciences
22
  • 7. Counting Sort, Radix Sort, Lower Bounds for Sorting (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Srini Devadas Applied Sciences
23
  • 8. Hashing with Chaining (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Srini Devadas Applied Sciences
24
  • 9. Table Doubling, Karp-Rabin (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Srini Devadas Applied Sciences
25
  • R1. Asymptotic Complexity, Peak Finding (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Victor Costan Applied Sciences