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.
Edwin plotted a graph on Desmos (an online graphing tool), which was continuous and differentiable at every point. Later he remembered the form of the function that represents the graph that he plotted but forgot some of the values that appeared in the expression. So he used and in place of the missing values and the function he wrote down had the following expression:
Can you help Edwin by finding the values of and ?
Which of the following statements is (are) correct?
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.
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 QDF3: 16 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 QDF3 at a glance |
|---|---|
| Term | January 2025 term |
| Subject | Mathematics for Data Science I |
| Course code | BSMA1001 |
| Questions | 16 |
| Marks | 50 |
| Duration | 180 min |
| MCQ | 5 |
| MSQ | 5 |
| Numerical | 6 |
| Official paper | IIT M FOUNDATION AN EXAM QDF3 13 Apr 2025 |
| Negative marking | No negative marking. |
| Updated |
