Detailed instructions for preparing for the final project presentation are posted at: Presentations.html
You have two options for the final project. If you choose the second option, make sure you get your proposal approved by one of the instructors before spending too much time on it.
Project presentations will take place during the lecture times on Monday, December 8, and Wednesday, December 10 in the lab 210 WVH.
Option 1: Finding Your Way
Project description: pdf
Option 2: Interactive Game
As an alternative project you may design an interactive game similar in complexity to the OceanWorld we have done earlier. It must include a collection of similar objects and at least two other objects that participate in the game, use both the timer ticks and the key events for controlling the progress of the game. It must also include some way of keeping the score and displaying the result of the game.
You must have your proposed game approved by the instructor. I will be available on Monday and Tuesday to meet with you. You may e-mail me the proposed game description prior to that, and suggest the times when you can meet. The approval meeting only takes a couple of minutes.
The graph algorithms.
You can find a concise description of the three graph algorithms (depth-first search, breadth-first search, and shortest-path search) in this pdf file. It includes the description of the shortest-path algorithm that we did not cover. You have received a hard copy of this document during the lab on Thursday.
The neighboring states.
You can find this information on any map of the USA. You can extract the data from the file capitals.txt
Alternately, you may use the code (as is or modified) in the file Capitals.java to initialize your data.
Computing the distances.
You may use the following hints to compute the distances between cities.
You may use the following image to enhance your display usa.gif.
Due Date: Monday, December 8, 2008 at 10:00 pm.
