GATE 2018 ME Set 2 · Question 61
The arc lengths of a directed graph of a project are as shown in the figure. The shortest path length from node 1 to node 6 is ________.
GATE 2018 · Mechanical Engineering · Set 2 · IIT Guwahati · printed as Q.51 in the ME section
Answer
From the official answer key published by IIT Guwahati.
Worked solution
To determine the shortest path from node 1 to node 6, we evaluate the possible directed paths and their total lengths:
1. Path :
2. Path :
3. Path :
4. Path :
5. Path :
6. Path :
7. Path :
The minimum path length is 7 (corresponding to path ).
*(Note: In project network contexts, the longest path is the critical path, which evaluates to 11; hence both values were accepted).*
Answer: 7
Practise Transportation, Assignment and Network Flow
8 GATE questions from this chapter, in short untimed sets, with the formula sheet beside them. Free.
More from Transportation, Assignment and Network Flow
- GATE 2017 ME Set 2 · Q48A product made in two factories, P and Q, is transported to two destinations, R and S. The per unit costs of…
- GATE 2014 ME Set 2 · Q28If there are m sources and n destinations in a transportation matrix, the total number of basic variables in…
- GATE 2014 ME Set 3 · Q31A minimal spanning tree in network flow models involves
- GATE 2014 ME Set 4 · Q28The total number of decision variables in the objective function of an assignment problem of size n × n (n…
- GATE 2024 ME · Q65In a supplier-retailer supply chain, the demand of each retailer, the capacity of each supplier, and the…
- GATE 2022 ME Set 1 · Q58An assignment problem is solved to minimize the total processing time of four jobs (1, 2, 3 and 4) on four…
Question from the official GATE 2018 ME paper (Set 2), IIT Guwahati. Solutions by PARIXO AI. All 65 questions of this paper.