A delivery truck must deliver packages to 6 different store locations (A, B, C, D, E, and F). The trip must start and end at C. The graph below shows the distances (in miles) between locations. We want to minimize the total distance traveled.
Using only the nearest-neighbor, repetitive nearest-neighbor, and cheapest-link algorithms (not brute force) on this graph,
A. the cheapest-link and the repetitive nearest-neighbor algorithms both yield the shortest trip.
B. the cheapest-link algorithm yields the shortest trip.
C. the nearest-neighbor and the repetitive nearest-neighbor algorithms both yield the shortest trip.
D. the nearest-neighbor algorithm yields the shortest trip.
E. the repetitive nearest-neighbor algorithm yields the shortest trip.
Answer: A
You might also like to view...
Find the value of d2y/dx2 at the point defined by the given value of t.x = sin t, y = 5 sin t, t = 
A. -10 B. 0 C. 10 D. -5
Solve the problem.Enrollment in a business seminar increased from 67 people to 86 people. What was the percent of increase?
A. 77.9% B. 22.1% C. 71.6% D. 28.4%
Factor completely. If the polynomial cannot be factored, say it is prime.10x4 + 19x2 + 6
A. (2x2 + 1)(5x2 + 6) B. (5x2 - 2)(2x2 - 3) C. (2x2 + 3)(5x2 + 2) D. (10x2 + 3)(x2 + 2)
Plot the point in the xy-plane. Tell in which quadrant or on what axis the point lies.(1, 2) 
A. 
Quadrant IV
B. 
Quadrant I
C. 
Quadrant I
D. 
Quadrant II