M-W-F 8:05 - 8:55am
Skiles 246
Spring 2008

Homework Assignments

1. Due Friday, January 18:  Send email to trotter@math.gatech.edu with (a) name - including the name you preferred to be called, (b) a paragraph or two about yourself: career and educational goals, hobbies, interests, etc., and (c) 150 x 200 pixel "head shot" picture for photo gallery.  you won't be able to answer many of the questions posed.
2. Due Monday, January 21:   Explain how Dijstra's algorithm can be used to find shortest paths containing the fewest number of edges. Hint: There are at least two different approaches. One method is to modify the algorithm to include a tie-breaker rule. A second approach is to modify the input data.

Updated January 16, 2008.