CS3851 -- Presentations

Presentation

Each student will be responsible for a 12 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
Thursday 2/12/09
Jared Brayshaw Shor's Algorithm
Mark Schadler A* Search
Dan Stone Levenshtein Distance Algorithm
Monday 2/16/09
Jonathan Havard MP3 Coding
Tim Bowman Monte Carlo Algorithms
Walter Huf Distributed Hash Tables
Wednesday 2/18/09
Jacob Hicks Ant Colony Algorithms
Tim Frigge Flocking Algorithm
Kevin Curtis PageRank
Thursday 2/19/09
Ben Finley Range Encoding
Joe Cavanagh DeCSS
Austin RasmussenRSA Encryption
Friday 2/20/09
Adam Hartman Genetic Algorithms

Grading Method

Students will be rated on a scale of 0 to 4 in the following categories:

  • Depth of presentation material (A)
  • Clarity of presentation (B)
  • Appropriate audio/visual usage in presentation (C)
  • Ability to answer questions/demonstrate deep knowledge in the topic (D)

The follow equation dictates the assignment grade: 68 + (A+B-6)*10 + (C-3)*3 + min(9,D*3)

In addition, a one point per minute penalty will be assessed for any presentation that is more than 2 minutes off of the target 12 minute length (not including questions).

  • © 2001-2009 Dr. Christopher C. Taylor •
  • Office: L-343 •
  • Phone: 277-7339 •
  • npǝ˙ǝosɯ@ɹolʎɐʇ