Mathematics for Data Science I, End Term
May 2024 term, 1 Sept 2024, Set QDF1
Which of the following is (are) correct?
Select all that apply.
Floyd-Warshall algorithm is used for all pair shortest paths.
The Shortest path problem is not applicable to a graph with a negative weight cycle.
Bellman-Ford algorithm is used for single source shortest path.
Dijkstra’s algorithm is used for all pair shortest paths.
Sign in to report a problem with this question.
You cannot change your answers after submitting.
The palette shows the status of every question. Pick a number to go straight to it.
Which of the following is (are) correct? Figure from the original question paper Figure from the original question paper
