Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

If N-Tech were to connect each pair of branches according to the quotation above, it would cost them a monthly charge of 13.110! In current

image text in transcribedimage text in transcribed

If N-Tech were to connect each pair of branches according to the quotation above, it would cost them a monthly charge of 13.110! In current pandemic, the management would like to have all branches connected but with minimum cost. Using your knowledge about Graph, help the management of N-Tech to find the minimum cost of connecting all branches. i. Represent the connections between branches using a weighted graph, with the branches as vertex, and the lease cost as edge weights. [4 marks] ii. Use Kruskal's algorithm to determine which links should be made so that there is a path between each pair of branches such that the total cost of the network is minimized. Label the edges in alphabetical order as you choose them. Give the minimum cost of the desired communication network. [6 marks] N-Tech Sdn. Bhd. plans to build a communications network connecting its eight (8) branches throughout Malaysia. Any pair of these branches can be linked with a leased telephone line. The following shows the price quotation of connecting the branches from Nexus Telco Sdn. Bhd. To Cost From | From Seremban Cost Ipoh 900 Kuantan 860 Seremban Ipoh Ipoh Muar 750 KL 850 Seremban KL 700 KL Muar 800 KI 800 KL Kuantan 810 Muar 750 Muar Tawau 1200 Melaka Melaka Melaka Kuching Tawau Kuching 1000 Melaka Kuantan 840 Melaka 1100 Kuching Tawau 800 Kuantan 950 If N-Tech were to connect each pair of branches according to the quotation above, it would cost them a monthly charge of 13.110! In current pandemic, the management would like to have all branches connected but with minimum cost. Using your knowledge about Graph, help the management of N-Tech to find the minimum cost of connecting all branches. i. Represent the connections between branches using a weighted graph, with the branches as vertex, and the lease cost as edge weights. [4 marks] ii. Use Kruskal's algorithm to determine which links should be made so that there is a path between each pair of branches such that the total cost of the network is minimized. Label the edges in alphabetical order as you choose them. Give the minimum cost of the desired communication network. [6 marks] N-Tech Sdn. Bhd. plans to build a communications network connecting its eight (8) branches throughout Malaysia. Any pair of these branches can be linked with a leased telephone line. The following shows the price quotation of connecting the branches from Nexus Telco Sdn. Bhd. To Cost From | From Seremban Cost Ipoh 900 Kuantan 860 Seremban Ipoh Ipoh Muar 750 KL 850 Seremban KL 700 KL Muar 800 KI 800 KL Kuantan 810 Muar 750 Muar Tawau 1200 Melaka Melaka Melaka Kuching Tawau Kuching 1000 Melaka Kuantan 840 Melaka 1100 Kuching Tawau 800 Kuantan 950

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Fundamentals of corporate finance

Authors: Robert Parrino, David S. Kidwell, Thomas W. Bates

2nd Edition

978-0470933268, 470933267, 470876441, 978-0470876442

Students also viewed these Accounting questions

Question

Was the researcher critically reflexive?

Answered: 1 week ago