SCCI Digital Library and Forum
Menu
Home
About Us
Video Library
eBooks
SCCI Forum
Home
»
Applied Sciences
»
Computer Science
»
Introduction to Algorithms, Fall 2011 (M-I-T)
»
R9. Rolling Hashes, Amortized Analysis (M-I-T)
R9. Rolling Hashes, Amortized Analysis (M-I-T)
Course:
Introduction to Algorithms, Fall 2011 (M-I-T)
Discipline:
Applied Sciences
Institute:
MIT
Instructor(s):
Victor Costan
Level:
Undergraduate
Introduction to Algorithms, Fall 2011 (M-I-T)
1. Algorithmic Thinking, Peak Finding (M-I-T)
10. Open Addressing, Cryptographic Hashing (M-I-T)
11. Integer Arithmetic, Karatsuba Multiplication (M-I-T)
12. Square Roots, Newton's Method (M-I-T)
13. Breadth-First Search (BFS) (M-I-T)
14. Depth-First Search (DFS), Topological Sort (M-I-T)
R10. Quiz 1 Review (M-I-T)
15. Single-Source Shortest Paths Problem (M-I-T)
R11. Principles of Algorithm Design (M-I-T)
16. Dijkstra (M-I-T)
17. Bellman-Ford (M-I-T)
R12. Karatsuba Multiplication, Newton's Method (M-I-T)
R13. Breadth-First Search (BFS) (M-I-T)
18. Speeding up Dijkstra (M-I-T)
R14. Depth-First Search (DFS) (M-I-T)
19. Dynamic Programming I: Fibonacci, Shortest Paths (M-I-T)
2. Models of Computation, Document Distance (M-I-T)
R15. Shortest Paths (M-I-T)
20. Dynamic Programming II: Text Justification, Blackjack (M-I-T)
R16. Rubik's Cube, StarCraft Zero (M-I-T)