Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Pakistan Railway has hired you for the task of repair of its rail networks of province SINDH, the cost of the repair of track between the different cities are presented in the given Table. For instance, the entry (KHI,HYD)= 10 in the table tells us the cost of building a rail connection between these two cities is 10 (in million rupees)     You are required to develop a rail network that connects all the cities by at least one path with the smallest cost by avoiding multiple paths to the same city. Hence the problem becomes the finding of Minimum spanning tree in a graph.   Your job is as follows;   a) Translate the given information in the form of Graph (Vertices & edges) b) Use Greedy Algorithms (Kruskal’s , if the S5 is odd & Prim’s technique , if S5 is even) to build rail connections in this scenario. Apply this algorithm and show all steps up to the final routes. c) What is the cost of repairing of resulting rail network?

Pakistan Railway has hired you for the task of repair of its rail networks of province SINDH, the cost of the repair of track between the different cities are presented in the given Table. For instance, the entry (KHI,HYD)= 10 in the table tells us the cost of building a rail connection between these two cities is 10 (in million rupees)     You are required to develop a rail network that connects all the cities by at least one path with the smallest cost by avoiding multiple paths to the same city. Hence the problem becomes the finding of Minimum spanning tree in a graph.   Your job is as follows;   a) Translate the given information in the form of Graph (Vertices & edges) b) Use Greedy Algorithms (Kruskal’s , if the S5 is odd & Prim’s technique , if S5 is even) to build rail connections in this scenario. Apply this algorithm and show all steps up to the final routes. c) What is the cost of repairing of resulting rail network?

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question
  • Pakistan Railway has hired you for the task of repair of its rail networks of province SINDH, the cost of the repair of track between the different cities are presented in the given Table. For instance, the entry (KHI,HYD)= 10 in the table tells us the cost of building a rail connection between these two cities is 10 (in million rupees)

 

 

You are required to develop a rail network that connects all the cities by at least one path with the smallest cost by avoiding multiple paths to the same city. Hence the problem becomes the finding of Minimum spanning tree in a graph.

 

Your job is as follows;

 

  1. a) Translate the given information in the form of Graph (Vertices & edges)

  2. b) Use Greedy Algorithms (Kruskal’s , if the S5 is odd & Prim’s technique , if S5 is even) to build rail connections in this scenario. Apply this algorithm and show all steps up to the final routes.
  3. c) What is the cost of repairing of resulting rail network?
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Numerical
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS