Name ______________________________________________________________
Quiz #6, Math 116, Winter 2008
1. a) A truck must drop off furniture at 4 different homes (A, B, C, and D) as shown in the graph below,
starting and ending at A. The numbers on the edges represent distances (in miles) between locations. The
truck driver wants to minimize the total length of the trip. Find the solution using the Repetitive Nearest
Neighbor Algorithm.
ADCBA=17
b) Circle the term that applies in the following sentence:
The Brute Force Algorithm is OPTIMAL/Non-OPTIMAL and EFFICIENT/INEFFICIENT.
2. A mail truck must deliver packages to 5 different homes (A, B, C, D, and E). The trip must start and end
at A. The graph below shows the distances (in miles) between locations. We want to minimize the total
distance traveled. Find the solution using the Cheapest Link Algorithm.
ABCDEA=68
3. A traveling saleswoman's territory consists of the 6 cities shown on the following mileage chart. The
saleswoman must organize a round trip that starts and ends at Memphis (her hometown) and will pass
through each of the other five cities exactly once. Find the solution using the Nearest Neighbor
Algorithm.
Memphis, Atlanta, Houston, Dallas, Kansas City, Denver, Memphis=3532