M

Mr. Dubey • 52.63K Points
Coach 

Q. What is the running time of Bellmann Ford Algorithm?

(A) o(v)
(B) o(v2)
(C) o(elogv)
(D) o(ve)
Share
Explanation by: Mr. Dubey 
 bellmann ford algorithm runs in time o(ve), since the initialization takes o(v) for each of v-1 passes and the for loop in the algorithm takes o(e) time. hence the total time taken by the algorithm is o(ve).

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. In virtual memory, which is not a page replacement algorithm ?

Q. A variable of type char can hold the value 301.

Q. The main difference between SNMPv3 and SNMPv2 is _______

Q. A NAND based S’-R’ latch can be converted into S-R latch by placing

Q. The primary key must be

Q. Which of the following statements create a dictionary?

Q. Which of the following is one of the most actively developing and important areas of cloud computing technology?

Q. Consider the following statements: (I) The output of a lexical analyzer is groups of characters. (II) Total number of tokens in printf("i=%d, &am

Q. The boolean function A + BC is a reduced form of

Q. In the words of …………………..,”…………………. means know

Question analytics