| 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 |
R10. Quiz 1 Review (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 8 |
15. Single-Source Shortest Paths Problem (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Srini Devadas
|
Applied Sciences
|
| 9 |
R11. Principles of Algorithm Design (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 10 |
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Srini Devadas
|
Applied Sciences
|
| 11 |
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Srini Devadas
|
Applied Sciences
|
| 12 |
R12. Karatsuba Multiplication, Newton's Method (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 13 |
R13. Breadth-First Search (BFS) (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 14 |
18. Speeding up Dijkstra (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Srini Devadas
|
Applied Sciences
|
| 15 |
R14. Depth-First Search (DFS) (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 16 |
19. Dynamic Programming I: Fibonacci, Shortest Paths (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Srini Devadas
|
Applied Sciences
|
| 17 |
2. Models of Computation, Document Distance (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Srini Devadas
|
Applied Sciences
|
| 18 |
R15. Shortest Paths (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 19 |
20. Dynamic Programming II: Text Justification, Blackjack (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Srini Devadas
|
Applied Sciences
|
| 20 |
R16. Rubik's Cube, StarCraft Zero (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 21 |
21. DP III: Parenthesization, Edit Distance, Knapsack (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Srini Devadas
|
Applied Sciences
|
| 22 |
R18. Quiz 2 Review (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 23 |
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
|
| 24 |
R19. Dynamic Programming: Crazy Eights, Shortest Path (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 25 |
R2. Python Cost Model, Document Distance (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
