Anonymous

CS GRE: Difference between revisions

From dankwiki
89 bytes added ,  02:31, 5 August 2009
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 lecture] from MIT's [http://ocw.mit.edu/OcwWeb/Electrical-Engineering-and-Computer-Science/6-046JFall-2005/CourseHome/index.htm 6.046J]
| [http://academicearth.org/lectures/dynamic-programming-leiserson Dynamic Programming] and [[http://academicearth.org/lectures/greedy-algorithms-and-graphs Greedy algorithms] 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