Name:
ID
Quiz3 Math Non-Science, Nov 30, 2011
Prof. Tsang
1. Shown in the table below are the one-way airfares between 5 cities.
a. Create a graph showing this data. (10 marks)
b. Find the minimum cost Hamiltonian circuit,
Using Nearest Neighbor starting in Seattle. (5 marks) S159H801C329M245L370S = 1904
Using Repeated Nearest Neighbor. (10 marks)
Using Sorted Edges. (5 marks) S159H801C323L245M654S =2182
2. Travel times by rail for a segment of the Eurail system is shown below with travel times in hours
and minutes. Find path with shortest travel time from Bern to Berlin by applying Dijkstra’s
algorithm. (15 marks)
Bern to Berlin 12:50
3. In the following graph, assume each of the horizontal edge has a length of 2 and each vertical
edge has a length of 1.
Name:
ID
Quiz3 Math Non-Science, Nov 30, 2011
Prof. Tsang
Mark all odd nodes and even nodes. (10 marks)
Eulerize this graph with minimum total duplication length, and find the minimum Euler circuit.
(15 marks)