Figure from the original question paper

(A) Option figure from the original question paper

(D) Option figure from the original question paper

(B) Option figure from the original question paper

(C) Option figure from the original question paper

Question text with a graph G drawing of two nested squares

(B) Option figure from the original question paper

(C) Option figure from the original question paper

(A) Option figure from the original question paper

(D) Option figure from the original question paper

Question text with a graph on vertices 0 to 7

(B) If we perform Depth First Search at node 7, then one of the possible order in which the nodes will be visited is 74356012

(C) If we perform Breadth-First Search at node 0, then one of the possible orders in which the nodes will be visited is 01264537.

(A) If we perform Breadth-First Search at node 0, then one of the possible orders in which the nodes will be visited is 01246573.

(D) If we perform Depth First Search at node 0, then one of the possible orders in which the nodes will be visited is 76435012.

Weighted graph for minimum cost spanning tree with missing weights x and y Based on the above data, answer the given subquestions. Figure from the original question paper

(B) Option figure from the original question paper

(C) Option figure from the original question paper

(A) Option figure from the original question paper

(D) Option figure from the original question paper

January 2025 term · Mathematics for Data Science I · BSMA1001

Mathematics for Data Science I End Term: 13 April 2025, Set QDF3 (January 2025 term)

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. Every question is below with its answer. Take it as a timed mock test to be marked, or read it through first.

Questions: 16
Marks: 50
Duration: 180 min
MCQ: 5
MSQ: 5
Numerical: 6

Take as mock test Practise with answers

Updated 25 Sept 2026

Official paper: IIT M FOUNDATION AN EXAM QDF3 13 Apr 2025 · No negative marking.

Question 1

+3 marksOne correct option

Which of the following options is true?

A
The cost of the spanning tree obtained by Prim’s Algorithm is the same as obtained by Kruskal’s Algorithm.
B
The minimum cost-spanning tree obtained by Prim’s Algorithm is the same as obtained by Kruskal’s Algorithm.
C
The minimum cost-spanning tree is not a tree.
D
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.

Show answer

Correct answer

A
The cost of the spanning tree obtained by Prim’s Algorithm is the same as obtained by Kruskal’s Algorithm.

Question 1 on its own page

Question 2

+3 marksOne correct option

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 $f(x)$ that represents the graph that he plotted but forgot some of the values that appeared in the expression. So he used $m, n,$ and $p$ in place of the missing values and the function he wrote down had the following expression:

$f(x) = \begin{cases} ne^x + 3, & x < 0 \\ mx + 2, & x = 0 \\ 5x + p + 1, & x > 0 \end{cases}$

Can you help Edwin by finding the values of $m, n,$ and $p$ ?

Show answer

Correct answer

Question 2 on its own page

Question 3

+3 marksOne or more correct options

Which of the following statements is (are) correct?

Select all that apply.

Show answer

Correct answers

Question 3 on its own page

Question 4

+3 marksOne or more correct options

Select all that apply.

Show answer

Correct answers

Question 4 on its own page

Question 5

+4 marksOne or more correct options

Select all that apply.

Show answer

Correct answers

Question 5 on its own page

Question 6

+4 marksOne or more correct options

Select all that apply.

A
If we perform Breadth-First Search at node 0, then one of the possible orders in which the nodes will be visited is 01246573.
B
If we perform Depth First Search at node 7, then one of the possible order in which the nodes will be visited is 74356012
C
If we perform Breadth-First Search at node 0, then one of the possible orders in which the nodes will be visited is 01264537.
D
If we perform Depth First Search at node 0, then one of the possible orders in which the nodes will be visited is 76435012.

Show answer

Correct answers

B
If we perform Depth First Search at node 7, then one of the possible order in which the nodes will be visited is 74356012
C
If we perform Breadth-First Search at node 0, then one of the possible orders in which the nodes will be visited is 01264537.

Question 6 on its own page

Question 7

+2 marksNumerical answer

Show answer

Correct answer: 0

Question 7 on its own page

Question 8

+3 marksNumerical answer

Show answer

Correct answer: 5

Question 8 on its own page

Question 9

+3 marksNumerical answer

Show answer

Correct answer: 17

Question 9 on its own page

Question 10

+3 marksNumerical answer

Show answer

Correct answer: 0.2 (accepted within ±0.1)

Question 10 on its own page

Question 11

+4 marksOne or more correct options

Based on the above data, answer the given subquestions.

Select all that apply.

Show answer

Correct answers

Question 11 on its own page

Question 12

+3 marksNumerical answer

Based on the above data, answer the given subquestions.

What is the minimum number of colors required to properly color the vertices of the given graph such that no two adjacent vertices share the same color?

Show answer

Correct answer: 4

Question 12 on its own page

Question 13

+3 marksOne correct option

A
TRUE
B
FALSE

Show answer

Correct answer

A
TRUE

Question 13 on its own page

Question 14

+3 marksNumerical answer

Show answer

Correct answer: 1

Question 14 on its own page

Question 15

+3 marksOne correct option

A
TRUE
B
FALSE

Show answer

Correct answer

B
FALSE

Question 15 on its own page

Question 16

+3 marksOne correct option

A
TRUE
B
FALSE

Show answer

Correct answer

A
TRUE

Question 16 on its own page