CS3851 -- Presentations

[an error occurred while processing this directive]

Presentation

Each student will be responsible for an 11 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
Week 9, Lecture 1
J. S.	Persistent Data Structures
C. R.	Hashing
Week 9, Lecture 2
V. C.	Shading Algorithms
J. W.	Smoothsort
L. K.	Dataflow Analysis
Week 9, Lecture 3
D. W.	Hirschberg's Algorithm
M. A.	BK Trees
B. C.	Genetic Algorithms
Week 10, Lecture 1
A. H.	Floyd's Cycle Detection
M. E.	Teleporting Turtle
A. W.	Bible Code
Week 10, Lecture 2
N. D.	Prime Number Algorithms
J. E.	Knight's Tour
C. L.	AES
Week 10, Lecture 3
E. M.	Ant Colony Optimization
J. P.	Ricart-Agrawala Algorithm

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 11 minute length (not including questions).