Presentation

Each student will be responsible for a 10 minute oral presentation of an algorithm or concept related to this course. The topic should be unique and not covered in class. A one paragraph abstract identifying the topic is due by the end of week 5. Presentations will be scheduled for week 10. Students are advised to take this assignment seriously as it is worth more than a lab grade. A typical student should plan to allocate 0.5-2 hours selecting a topic, 4 hours researching the topic, 4 hours developing a presentation, and 1 hour practicing.

Student Presentation
Friday 11/3/06
Paul Kratt DeCSS Algorithm
Bob Geboy Genetic Algorithms
John Regner Hq2x Image Magnification Algorithm
Tuesday 11/7/06
Jeff Wood Shell Sort Algorithm
Kevin Zuehlke Bucket Sort Algorithm
Kieran Easter Gnome and Bubble Sort Algorithms
Nick Footit Skip Lists Data Structure
Thursday 11/9/06
Keith Dawson Soundex Algorithm
JR Shampang Monte Carlo Algorithms
Derek Hoffmeister Bellman-Ford Algorithm
Adam Patterson Longest Common Subsequence Algorithm
Friday 11/10/06
Keith Ott MD5 Algorithm
Ryan Kramer Pseudoprime and Modular-Exponentiation Algorithms
Kong Vang Simplex Algorithm
Karsten Huttelmaier Search Algorithms for Chess