CS 4349.003. Advanced Algorithm Design and Analysis (Spring 2017) Final exam: Thu, May 4, 2:15-4:15 PM Closed book, notes Topics ------ Math: Recurrences, sums of sequences, order notation D&C: Binary search, x^n, Merge sort DP: Rod-cutting, Matrix-chain multiplication, Longest common subsequence Greedy: Activity selection Graph: Representation, BFS, DFS (topological order) MST: Prim, Kruskal, generic, Disjoint set ADT (Union-Find) SP: Bellman-Ford, DAG-shortest paths, Dijkstra, Floyd-Warshall Flow: Ford-Fulkerson NPC: Clique, Vertex Cover