A

Admin • 37.39K Points
Coach

Q. to solve the all-pairs shortest paths problem which algorithm's is/are used
a) Floyd's algorithm
b) Dijkstra's single-source shortest paths
c) Prim's Algorithm
d) Kruskal's Algorithm

  • (A) a) and c)
  • (B) a) and b)
  • (C) b) and c)
  • (D) c) and d)
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. Which of the following statement is true?

Q. Which of the following data structure is linear data structure?

Q. Host codes in a CUDA application can not Invoke kernels

Q. During a month with 30 days, a cricket team plays at least one game a day, but no more than 45 games. There must be a period of some number of consecu

Q. ASCII code is a

Q. Which of the following in not Outer join?

Q. Consider attributes ID , CITY and NAME . Which one of this can be considered as a super key ?

Q. Risk exposure is given by which formula

Q. The ciphers of today are called round ciphers because they involve

Q. What is often undefined and is left to the ingenuity of the project managers and engineers?

Question analytics