Ques #:38 In an unweighted, undirected connected g...
Guiding State PSC aspirants since 2016 50,000+ students · 1,000+ final selections Exam Calendar Results Call 9116926003
pscnotes
Pick your state
RPSC Prelims previous year questions

Ques #:38 In an unweighted, undirected connected graph, the shortest path from a node S to every other node is computed most efficiently, in terms of time complexity, by

Asked in RPSC 23Feb 2016Question Paper for VicePrincipal/Superintendent ITI Screening Test 2012(Computer Science)VICE PRINCIPAL/SUPDT. ITI - 2012

  1. Dijkstra's algorithm starting from S
  2. Warshall's algorithm
  3. Performing a DFS starting from S
  4. Performing a BFS starting from S
Show answer

Answer: D. Performing a BFS starting from S

More RPSC Prelims previous year questions questions

All 8,445 RPSC Prelims previous year questions questions →