Exciting news: Final is not cumulative
CHAPTER 8: Dynamic Programming, namely:
- Optimal Binary Search Tree (similar idea for last program assignment)
- Warshall’s Algorithm (specificaslly, Transitive Closure)
- Be able to generate the adjacency matrix little-by-little by transitive closure
- Floyd’s Algorithm
CHAPTER 9: Greedy Technique, namely:
- Minimum Spanning Tree
- Prim
- Kruskal
- Djikstra’s (be able to construct it via Tree Verts and Remaining table)
- Huffman Codes (requires understanding of BST)
CHAPTER 10: Linear Programming (iterative development), namely:
- Maximum Flow Problem
- Shortest-Augmenting-Path Algorithm
- Gale-Shapley