Project
This project is designed to allow a more in-depth study in some area of algorithms of your choice. You may choose a topic from the list below or select one of your own.
(Discussing suitability and scope with me might be a good idea.)
- topics:
- balanced trees, e.g. AVL-trees, B-trees, game trees
- graph algorithms, e.g. network flows, how to draw, traveling salesman ...
- dynamic programming, e.g. matrix multiplication chains
- algebraic and numeric algorithms, e.g. fast fourier transform
- geometric algorithms, e.g. convex hull
- cryptography
- hashing, e.g. quadratic probing
- parallel algorithms
- deliverables:
- If your project includes implementation of algorithms, the deliverables you turn in should be similar to previous homeworks.
- Otherwise, I expect a small paper (3 to 5 pages) with lots of new examples.
- In either case, please include a short bibliography. Use your textbook, books from the library and/ or sources from the web.
- time table:
- We 11/22: decide on your topic
- We 11/29: turn-in a paragraph outlining your project
- Mo 12/11: mini presentation and deliverables due