Projects

• Project presentation in class (15 min)
• Report (4, 5 pages or more). The report should be submitted before the presentation.

Project topics  include, but are not limited to, the following:

-Probabilistic Algorithms,
- Linear Programing,
- Polynomials and Matrices,
- String Matching,
- Arithmetic Circuits,
- Number-Theoretic Algorithms,
- Sorting Networks,
- Computational Geometry
- Algorithms for Parallel Computers
- Study of Quicksort
- Binomial Heaps,
- Fibonacci Heaps,
- Disjoint Sets,
- Red-Black Trees,
- Deterministic Skip Lists,
- AA-Trees,
- Treaps,
- k-d Trees,
- Pairing Heaps
 

Please send me your choice of topic and day of presentation as soon as you can.

Schedule of the Project Presentations

Monday April 02, 10:00-11:00

• Jason Benett.  Game programming.

Tuesday April 03,  9:25-10:40

• Jonathan Kovacs. Evolutionary Algorithms.
• Chris Pinchak. Parallel Algorithms.
• Byron Noriega. STRING MATCHING.

Thursday April 05 , 9:25-10:40

• Keith Pearson. Red-Black Trees.
• Mike Closson. Computational Geometry.
• David Sanders. 3D algorithms :  representing 3D data.
• Vincent Yeung. Sorting Network.