COMP 6785 Theory of Algorithms
- Where and when
- LWF 13:30--14:30, M-118.
Topics (tentative)
- Growth of functions
- Recurrences
- Probabilistic analysis and randomised algorithms
- Sorting and order statistics
- Binary search trees
- Red-black trees
- Augmenting data structures
- Dynamic programming
- Greedy algorithms
- Data structures for disjoint sets
- Graph algorithms
- Text
- Introduction to algorithms, by Cormen, Leiserson, Rivest and
Stein, McGraw Hill, 2001 (2nd edition)
The final exam is on Dec 17, from 2:15 to 4:15pm, in M-301. I will
have office hours on Dec 11 and 13 from 18:00 to 20:00, during which
you may pick up some work (hw 4 and 5 are ready).
- Homework (updated Dec 4).
Miscellaneous
MIT's Open Course Ware 6.046J home page
A lot of useful material, including an extensive reference list.
Last modified: Mon Dec 10 22:20:24 AST 2012