Test Index

GATE Computer Science (CS) 2012 Solved Paper

© examsnet.com

Question : 50

Total: 65

Consider the directed graph shown in the figure below. There are multiple shortest paths between vertices S and T. Which one will be reported by Dijkstra’s shortest path algorithm? Assume that, in any iteration, the shortest path to a vertex v is updated only when a strictly shorter path to v is discovered.

SDT
SBDT
SACDT
SACET

Go to Question:

Prev Question

Next Question