A university has eight buildings that need to be connected so that each of the b
ID: 652034 • Letter: A
Question
A university has eight buildings that need to be connected so that each of the building's computer network is accessible to the network in the other buildings. The distances between buildings are given below (in units of 1000 yards). Which pairs of buildings should be directly connected to connect all the buildings with a minimum total network length? What is the length of a minimum network? What are the different possible minimal networks?
Which pairs of buildings should be directly connected to connect all the buildings with a minimum total network length? What is the length of a minimum network? What are the different possible minimal networks?
2 1.6 3 1.4 0.9 4 0.5 18 2.6 5 1.2 1.2 1.7 0.7 6 1.5 2.6 2.5 1.6 0.9 7 1.8 2.3 1.9 1.5 1.1 0.6 8 2.3 1.1 1.0 0.9 08 1.0 0.5Explanation / Answer
If we use any one minimum spanning tree algorithm we get....
Building 1 and 4 connected distance is 0.5
Building 2 and 3 connected distance is 0.9
Building 3 and 8 connected distance is 1.0
Building 4 and 5 connected distance is 0.7
Building 5 and 8 connected distance is 0.8
Building 6 and 7 connected distance is 0.6
Building 7 and 8 connected distance is 0.5
Total distance for all connected building is 5.0 i.e 5000 yards
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.