Modified from the official paper: Match each specified shortest-path workload…
ISRO Scientist/Engineer SC · 2025 · Computer Science · Part A · DisciplineModified — slightly modified from the official paper; see the solution
Modified from the official paper: Match each specified shortest-path workload to the algorithm named in the table.
Scenarios | Algorithms |
(P) For repeated place-to-place queries, first precompute shortest paths between every pair of places. | (i) Floyd's algorithm |
(Q) A person visits required places in successive stages of a directed acyclic graph. | (ii) Multi-stage graph algorithm |
(R) For each of N persons, run a single-source shortest-path search over nonnegative edge weights to reach M places. | (iii) Dijkstra's algorithm |
- A.
P – (iii), Q – (ii), R – (i)
- B.
P – (i), Q – (iii), R – (ii)
- C.
P – (ii), Q – (i), R – (iii)
- D.
P – (i), Q – (ii), R – (iii)
Attempted by 517 students.
Show answer
Correct answer: D
Explore the full course: Iocl Engineers Officers Grade A Paper 2