LEJ Knowledge Hub

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
26
  • R10. Quiz 1 Review (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Victor Costan Applied Sciences
27
  • R11. Principles of Algorithm Design (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Victor Costan Applied Sciences
28
  • R12. Karatsuba Multiplication, Newton's Method (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Victor Costan Applied Sciences
29
  • R13. Breadth-First Search (BFS) (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Victor Costan Applied Sciences
30
  • R14. Depth-First Search (DFS) (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Victor Costan Applied Sciences
31
  • R15. Shortest Paths (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Victor Costan Applied Sciences
32
  • R16. Rubik's Cube, StarCraft Zero (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Victor Costan Applied Sciences
33
  • R18. Quiz 2 Review (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Victor Costan Applied Sciences
34
  • R19. Dynamic Programming: Crazy Eights, Shortest Path (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Victor Costan Applied Sciences
35
  • R2. Python Cost Model, Document Distance (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Victor Costan Applied Sciences
36
  • R20. Dynamic Programming: Blackjack (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Victor Costan Applied Sciences
37
  • R21. Dynamic Programming: Knapsack Problem (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Victor Costan Applied Sciences
38
  • R22. Dynamic Programming: Dance Dance Revolution (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Victor Costan Applied Sciences
39
  • R23. Computational Complexity (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Victor Costan Applied Sciences
40
  • R24. Final Exam Review (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Victor Costan Applied Sciences
41
  • R3. Document Distance, Insertion and Merge Sort (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Victor Costan Applied Sciences
42
  • R5. Recursion Trees, Binary Search Trees (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Victor Costan Applied Sciences
43
  • R6. AVL Trees (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Victor Costan Applied Sciences
44
  • R7. Comparison Sort, Counting and Radix Sort (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Victor Costan Applied Sciences
45
  • R8. Simulation Algorithms (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Victor Costan Applied Sciences
46
  • R9. Rolling Hashes, Amortized Analysis (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Victor Costan Applied Sciences
47
  • Recitation 9b: DNA Sequence Matching (M-I-T)
Introduction to Algorithms, Fall 2011 (M-I-T) MIT Victor Costan Applied Sciences

Basic and Health Sciences

Applied Sciences

Social Sciences