PARIXO GATE · ME Open the app

GATE 2018 ME Set 2 · Question 61

2 marksNumerical answerIndustrial EngineeringTransportation, Assignment and Network Flow

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 ________.

Figure 1 for GATE 2018 ME Set 2 question 61

GATE 2018 · Mechanical Engineering · Set 2 · IIT Guwahati · printed as Q.51 in the ME section

Answer
7 or 11

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

Question from the official GATE 2018 ME paper (Set 2), IIT Guwahati. Solutions by PARIXO AI. All 65 questions of this paper.