Ch8 Flashcards
(5 cards)
1
Q
Dynamic Programming
A
A general algorithm design technique for solving problems defined by recurrences with overlapping subproblems
2
Q
Optimal BST
A
3
Q
Transitive Closure - Warshall’s
A
A path exists from i to j IFF there is an edge from i to j
or there is a path from i to j going through intermediate vertices
4
Q
Shortest Paths - Floyd’s
A
5
Q
Greedy Algorithms
A
