Floyd Warshall’s Algorithm can be applied on

Home / Engineering / Design and Analysis of Algorithms / Question

Mr. Dubey • 51.43K Points
Coach

Q.) Floyd Warshall’s Algorithm can be applied on

(A) undirected and unweighted graphs

(B) undirected graphs

(D) acyclic graphs

Correct answer : Option (C) - directed graphs

Explanation:

 floyd warshall algorithm can be applied in directed graphs. from a given directed graph, an adjacency matrix is framed and then all pair shortest path is computed by the floyd warshall algorithm.

Discusssion

Related MCQs on Design and Analysis of Algorithms

Q. Tasks whose execution would begin randomly and within the interval of arrival times of consecutive tasks is known as

Q. How many verb tenses are there in the English language?

Q. ______________ is used to show hierarchy in a pseudo code.

Q. If U = {1, 2, 3, . . . 20 } and S = set of prime numbers , then S =

Q. __________ is a standard suite of protocols used for packet switching across computer networks.

Q. A monitor is a type of

Q. A data warehouse is__________.

Q. Suppose d = {“john”:40, “peter”:45}, to delete the entry for “john” what command do we use?

Q. ___________ of data means that the attributes within a given entity are fully dependent on the entire primary key of the entity.

Q. Which of the following ﬁxed database roles can add or remove user IDs?