A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. Dijkstra algorithm, which solves the single-source shortest-paths problem, is a_______________, and the Floyd-Warshall algorithm, which finds shortest paths between all pairs of vertices, is a _____________.
a. Greedy algorithm, Divide-conquer algorithm
b. Divide-conquer algorithm, Greedy algorithm
c. Greedy algorithm, Dynamic programming algorithm
d. Dynamic programming algorithm, Greedy algorithm
Answer:Dynamic programming algorithm, Greedy algorithm
71000434158 :(October 17, 2019) c is correct
Click to Add Comment

Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: