Assignment #1
Assignment #2
Assignment #3
Assignment #4
Assignment #5
Assignment #6
Assignment #7
| - 9/10/12 | Chapter 15: Dynamic Programming | Matrix Chain Multiplication:
wiki
*notes
Bitonic Traveling Salesman Problem: wiki soln1 *soln2 soln3 Printing Neatly: soln1 *soln2 |
| - 9/24/12 | Chapter 16: Greedy Algorithms | sol |
| - 10/8/12 | Chapter 17:Amortized Analysis Chapter 18: B-Trees | Chapter 17 Notes |
| - 10/22/12 | Chapter 19: Binomial Heaps | |
| - 11/05/12 | Chapter 19: Binomial Heaps Chapter 22: Elementary Graph Algorithms | MST (using binomial Heaps) Adjacency-list Adjacency-Matrix |
| - 11/26/12 | Chapter 22: Elementary Graph Algorithms | Breadth-first search Depth-first search Topological sort Strongly connected components | - 12/3/12 | Chapter 23: Minimum Spanning Trees Chapter 24: Single-Source Shortest Paths | MST Kruskal's Algorithm Prim's Algorithm Bellman-Ford Algorithm Nested Boxes |