112 Section 7 Assessment Nelabar Algorithm. An algorithm is a step-by-step procedure used to solve a problem. The Nearest Neighbor algorithm requires that you always choose the location nearest you as your best choice Do you think total distance calculated in Problem 1 is the smallest possible total distance Fill in the diagram by writing the distance between each pair of buildings on the arrow connecting them. b. Write the total distance for each possible.route in the appropriate box. Student Center Math & Science Building Health Center Fine Arts Complex Fine Arts Health Ctr Fine Arts Math & Sci. Health Ctr Math & Sci. Health Ctr Fine Arts Math & Sci. Fine Arts Math & Sci. Health Ctr T TT TTT Student Ctr Student Ctr Student Ctr Student Ctr Total Distance: Student Ctr Student Ctr 4. Notice how this diagram shows all the possible routes (MWF schedules) in terms of the buildings where the classes are held. a. How many different total distances did you calculate? b. How many of the distance totals appear more than once? c. Is there a pattem here? Explain. 5. What is the shortest total distance? Is this the same route that you calculated using the Nearest Neighbor Algorithm? 6. What is the big advantage in using the Nearest Neighbor Algorithm to determine a solution? 112 Section 7 Assessment Nelabar Algorithm. An algorithm is a step-by-step procedure used to solve a problem. The Nearest Neighbor algorithm requires that you always choose the location nearest you as your best choice Do you think total distance calculated in Problem 1 is the smallest possible total distance Fill in the diagram by writing the distance between each pair of buildings on the arrow connecting them. b. Write the total distance for each possible.route in the appropriate box. Student Center Math & Science Building Health Center Fine Arts Complex Fine Arts Health Ctr Fine Arts Math & Sci. Health Ctr Math & Sci. Health Ctr Fine Arts Math & Sci. Fine Arts Math & Sci. Health Ctr T TT TTT Student Ctr Student Ctr Student Ctr Student Ctr Total Distance: Student Ctr Student Ctr 4. Notice how this diagram shows all the possible routes (MWF schedules) in terms of the buildings where the classes are held. a. How many different total distances did you calculate? b. How many of the distance totals appear more than once? c. Is there a pattem here? Explain. 5. What is the shortest total distance? Is this the same route that you calculated using the Nearest Neighbor Algorithm? 6. What is the big advantage in using the Nearest Neighbor Algorithm to determine a solution