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

Admin • 36.93K 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)

(D) c) and d)

Correct : Option (B)

Discusssion

Be the first to start discuss.

Q. global_count += 5;

Q. IP4 is more commonly used than IPv6?

Q. Which of the following operators has its associativity from right to left?

Q. Which of these is not an antecedent of the cloud?

Q. ___________ is a good alternative to the star schema.

Q. Which one of the following is suitable? 1. When the hypothsis space is richer, overfitting is more likely. 2. when the feature space is larger , overf

Q. Which is stored information about description of data in the database:

Q. Which one of the following is the multiple access protocol for channel access control?

Q. MPI provides a function ________, for packing data into a buffer of contiguous memory.

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

Discusssion

Related MCQs