M

Mr. Dubey • 100.69K Points
Coach

Q. What is the running time of the Floyd Warshall Algorithm?

  • (A) big-oh(v)
  • (B) theta(v2)
  • (C) big-oh(ve)
  • (D) theta(v3)
Share
Explanation by: Mr. Dubey
the running time of the floyd warshall algorithm is determined by the triply nested for loops. since each execution of the for loop takes o(1) time, the algorithm runs in time theta(v3).

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. is a virtual server platform that allows users to create and run virtual machines on Amazon’s server farm.

Q. The prefix on IC's indicates a broader operating temperature range, and the devices are generally used by the military.

Q. The output of NOR gate is

Q. The requires that each transaction Ti executes in two or three different phases in its lifetime, depending on whether it is a re

Q. Data mining is

Q. Staff development plan describes how the skills and experience of the project team members will be developed.

Q. Which of the following is a part of system release?

Q. The _____________ helps you to create tree structures of objects.

Q. A index is the one which satisfies all the columns requested in the query without performing further lookup into t

Q. With A = False and B = True, which statement evaluates as True?

Question analytics