General Review

Asymptotics
Master Theorem
Divide and Conquer

T(n) = aT(n/b) + f(n)

Graphs

DFS: finding connected components and topological sort order

DP
Subproblems
Relate
Base Cases
Solution
Time
Complexity
P: polynomial
NP: certificate verifiable in polynomial
EXP: exponential
R: finite

Reductions: A->B means B is at least as hard as A

NP-Hard: all problems that are at least as hard as every problem in NP

NP-Complete: NP-Hard intersect NP
Data Structures and Sorting
AVL
Graphs
Dynamic Programming