Question 2
Which of the following options is true?
The minimum cost-spanning tree obtained by Prim’s Algorithm is always the same as obtained by Kruskal’s Algorithm.
The minimum cost-spanning tree is not a tree.
The cost of the spanning tree obtained by Prim’s Algorithm is the same as obtained by Kruskal’s Algorithm.
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.
Question 3
Which of the following statements is (are) correct?
16 more questions in this paper
Sign in with Google — it is free — to see every question with its answer and explanation, practise it in learning mode, or take it as a timed mock test.
More on the Maths 1 End Term 13 Apr 2025 Set QDF1 paper
The IIT Madras BS Mathematics for Data Science I (Maths 1) End Term paper sat on 13 Apr 2025, in the January 2025 term, set QDF1: 19 questions for 50 marks in 180 minutes. The first 3 questions are below. Sign in with Google — it is free — to see the whole paper with its answers and explanations, in learning mode or as a timed mock test.
| Feature | Maths 1 End Term 13 Apr 2025 Set QDF1 at a glance |
|---|---|
| Term | January 2025 term |
| Subject | Mathematics for Data Science I |
| Course code | BSMA1001 |
| Questions | 19 |
| Marks | 50 |
| Duration | 180 min |
| MCQ | 5 |
| MSQ | 5 |
| Numerical | 9 |
| Official paper | IIT M FOUNDATION AN EXAM QDF3 13 Apr 2025 |
| Negative marking | No negative marking. |
| Updated |