The paper presentation will be 25 minutes long. It will cover a topic related to multidimensional indexes that was published after the handout received on the first day. In other words, your presentation will update the computer surveys paper to indicate what is happening recently within the field. there are several such papers available from the ACM Digital Library.
The project for this course is to create a multimedia presentation using flash. The project must accept an XML document that describes a graph. We are using GraphML as the graph definition language. You must display the graph with nodes and edges in flash, and then you must perform a graph algorithm on the graph. For example, I am implementing a DFS approach to TSP. Algorithms possible include Dijkstra's, minimum spanning tree, Euler cycles and paths, Hamilton cycles and paths, and others. You should discuss with me which algorithm you want to present, and all algorithms are FCFS. The presentation should use text, audio and animation. It should have two modes: step-by-step and continuous. In step-by-step mode, the algorithm progresses only when the user clicks a button. The audio should be disabled, but sound effects should still be included. In continuous mode, the audio should describe each step as it is progressing through the program, and the pace of the demonstration should allow a user to follow along. The final presentation should be useful as a web application, ideally with it being very easy to change the underlying graph and run the application again (perhaps by specifying a URL with a new GraphML?).
|
Joel Anderson Minimum Spanning Tree |
Paul Edelman Approximate TSP Tour Algorithm |
Aaron Kelley Floyd Warchall All Shortest Paths |
Brandy Brewster Approximation Algorithm for Vertex Cover |
Kevin Kastner |
The final examination will be comprehensive, but will emphasize material covered in the last half of the course.
