UGC NET CS 2015 Jun- paper-2
October 16, 2023Programming
October 16, 2023Aptitude
| Question 14 |
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?
| 1-f-e-2
| |
| 1-f-b-2 | |
| 1-b-2 | |
| 1-a-c-2
|
Question 14 Explanation:
1 – f – e – 2 ─ 100 + 100 + 200 = 400
1 – f – b – 2 ─ 100 + 0 + 200 = 300 ⇾ shortest [Answer]
1 – b – 2 ─ 300 + 200 = 500
1 – a – c ─ 2 – 200 + 100 + 100 = 400
Correct Answer: B
Question 14 Explanation:
1 – f – e – 2 ─ 100 + 100 + 200 = 400
1 – f – b – 2 ─ 100 + 0 + 200 = 300 ⇾ shortest [Answer]
1 – b – 2 ─ 300 + 200 = 500
1 – a – c ─ 2 – 200 + 100 + 100 = 400
Subscribe
Login
0 Comments