9,526
edits
CS GRE: Difference between revisions
From dankwiki
→Subject Material
| Line 153: | Line 153: | ||
|colspan=2| '''Algorithms and complexity''' | |colspan=2| '''Algorithms and complexity''' | ||
|- | |- | ||
| Exact and asymptotic analysis of specific algorithms | | Exact and asymptotic analysis of specific algorithms <small>'''''Big-O (<math>O(f())</math>), Big-Theta (<math>\Theta(f())</math>), Big-Omega (<math>\Omega(f())</math), Little-O (<math>o(f()))</math>)''''', </small> | ||
| | | [http://academicearth.org/lectures/asymptotic-notation-and-recurrences Asymptotic Notation and Recurrences] lectures from MIT's [http://ocw.mit.edu/OcwWeb/Electrical-Engineering-and-Computer-Science/6-046JFall-2005/CourseHome/index.htm 6.046J] | ||
|- | |- | ||
| Algorithmic design techniques (e.g. greedy, dynamic programming, divide and conquer) | | Algorithmic design techniques (e.g. greedy, dynamic programming, divide and conquer) | ||
