# CS GRE: Difference between revisions

From dankwiki

Line 153: | Line 153: | ||

|- | |- | ||

| Algorithmic design techniques (e.g. greedy, dynamic programming, divide and conquer) | | Algorithmic design techniques (e.g. greedy, dynamic programming, divide and conquer) | ||

| [http://academicearth.org/lectures/dynamic-programming-leiserson Dynamic Programming] and [http://academicearth.org/lectures/greedy-algorithms-and-graphs Greedy | | [http://academicearth.org/lectures/dynamic-programming-leiserson Dynamic Programming] and [http://academicearth.org/lectures/greedy-algorithms-and-graphs Greedy algorithm] lectures from MIT's [http://ocw.mit.edu/OcwWeb/Electrical-Engineering-and-Computer-Science/6-046JFall-2005/CourseHome/index.htm 6.046J] | ||

|- | |- | ||

| Upper and lower bounds on the complexity of specific problems | | Upper and lower bounds on the complexity of specific problems |