CS3851 -- Presentations

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 6. Presentations will be scheduled for weeks 9 and 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 Topic
Friday 11/2/07
Student 1 Nik Karpinsky Pseudorandom Number Generator
Student 2 Kyle Malloy AES Algorithm
Student 3 Tyler Pausma Levenshtein Distance Algorithm
Student 4 Ben Shoemaker Rabin-Karp Algorithm
Tuesday 11/6/07
Student 1 Scott Phillips Flocking Algorithms
Student 2 Dan Fischer Comb Sort
Student 3 Matt McAnelly Bellman-Ford Algorithm
Student 4 Brian Semrad Shell Sort
Wednesday 11/7/06
Student 1 Grace Bolanos Graph Coloring
Student 2 Matt Zeman A* Algorithm
Student 3 Mike Horning Minimax Algorithm
Student 4 Robert Herold Jarvis March Algorithm
Friday 11/9/06
Student 1 Ryan Nelson Pancake Sort
Student 2 Erich Schroeter Hirschberg's Algorithm
Student 3 Josh Fasching RSA Cryptosystem
Student 4 Wes Biese Burrows Wheeler Transform Optimizations
  • © 2001-2009 Dr. Christopher C. Taylor •
  • Office: L-343 •
  • Phone: 277-7339 •
  • npǝ˙ǝosɯ@ɹolʎɐʇ