Mathematics for Data Science I, End Term
January 2025 term, 13 Apr 2025, Set QDF3
Which of the following options is true?
The cost of the spanning tree obtained by Prim’s Algorithm is the same as obtained by Kruskal’s Algorithm.
The minimum cost-spanning tree obtained by Prim’s Algorithm is the same as obtained by Kruskal’s Algorithm.
The minimum cost-spanning tree is not a tree.
If the weight of each edge in a graph is equal, then the total cost of the graph is equal to the cost of the minimum cost-spanning tree.
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 options is true? Figure from the original question paper Which of the following statements is (are) correct?
