Open In App

GATE | GATE CS 2020 | Question 5

Like Article
Like
Save
Share
Report

There are multiple routes to reach from node 1 to node 2, as shown in the network.

The cost of travel on an edge between two nodes is given in rupees. Nodes ‘a’, ‘b’, ‘c’, ‘d’, ‘e’, and ‘f’ are toll booths. The toll price at toll booths marked ‘a’ and ‘e’ is Rs. 200, and is Rs. 100 for the other toll booths. Which is the cheapest route from node 1 to node 2 ?
(A) 1−a−c−2
(B) 1−f−b−2
(C) 1−b−2
(D) 1−f−e−2


Answer: (B)

Explanation: (A) Cost of 1-a-c-2 : 
 

200 + 200 + 100 + 100 + 100 = 700

(B) Cost of 1-f-b-2 : 
 

100 + 100 + 0 + 100 +200 = 500

(C) Cost of 1-b-2 : 
 

300 + 100 + 200 = 600 

(D) Cost of 1-f-e-2 : 
 

100 + 100 + 100 + 200 + 200 = 700

Hence, 1-f-b-2 is having minimum cost. 

Option (B) is correct.


Quiz of this Question


Last Updated : 03 Aug, 2021
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads