The GATE Grind

GATE 2026 PI – Question 22

Operations Research and Operations Management · Operations Research · 1 mark · Multiple choice

In the weighted graph, edge weights are distances. Let d be the shortest distance from A to E and p the number of paths attaining d. Find d/p.

Diagram for GATE 2026 PI question 22
  1. 5
  2. 3
  3. 2
  4. 8

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (C) 2

Explanation

From A, the minimum distances to C and B are 1 and 2; B can be reached directly or through C. E is reached at distance 6 by A–B–E, A–C–B–E, or A–C–F–E. Routes through D are longer. Hence d = 6, p = 3 and **d/p = 2, C**.

More Operations Research questions

All Operations Research questions →