Figure from the original question paper

(A) Option figure from the original question paper

(B) Option figure from the original question paper

(C) Option figure from the original question paper

(D) Option figure from the original question paper

Question text with a graph G drawing of two nested squares

(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 on vertices 0 to 7

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

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

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

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

Figure from the passage in the original paper Which of the following options is/are true ?

(A) Option figure from the original question paper

(C) Option figure from the original question paper

(B) 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 QDF1 (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 QDF1: 19 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: 19
Marks: 50
Duration: 180 min
MCQ: 5
MSQ: 5
Numerical: 9

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

+2 marksOne correct option

Show answer

Correct answer

Question 1 on its own page

Question 2

+3 marksOne correct option

Which of the following options is true?

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

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

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

+4 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.

A
If we perform Breadth-First Search at node 0, then one of the possible orders in which the nodes will be visited is 01423567.
B
If we perform Depth First Search at node 0, then one of the possible order in which the nodes will be visited is 04123576
C
If we perform Breadth-First Search at node 0, then one of the possible orders in which the nodes will be visited is 01423765.
D
If we perform Depth First Search at node 0, then one of the possible orders in which the nodes will be visited is 04132567.

Show answer

Correct answers

A
If we perform Breadth-First Search at node 0, then one of the possible orders in which the nodes will be visited is 01423567.
D
If we perform Depth First Search at node 0, then one of the possible orders in which the nodes will be visited is 04132567.

Question 5 on its own page

Question 6

+2 marksNumerical answer

Show answer

Correct answer: 0

Question 6 on its own page

Question 7

+3 marksNumerical answer

Show answer

Correct answer: 120

Question 7 on its own page

Question 8

+2 marksNumerical answer

Based on the above data, answer the subquestions.

Show answer

Correct answer: 15

Question 8 on its own page

Question 9

+2 marksNumerical answer

Based on the above data, answer the subquestions.

Show answer

Correct answer: 0.12 (accepted within ±0.01)

Question 9 on its own page

Question 10

+1 markOne correct option

A
TRUE
B
FALSE

Show answer

Correct answer

B
FALSE

Question 10 on its own page

Question 11

+1 markOne correct option

A
TRUE
B
FALSE

Show answer

Correct answer

A
TRUE

Question 11 on its own page

Question 12

+1 markOne correct option

A
TRUE
B
FALSE

Show answer

Correct answer

A
TRUE

Question 12 on its own page

Question 13

+2 marksNumerical answer

Show answer

Correct answer: -2

Question 13 on its own page

Question 14

+3 marksNumerical answer

Based on the above data, answer the given subquestions.

Show answer

Correct answer: 6

Question 14 on its own page

Question 15

+3 marksNumerical answer

Based on the above data, answer the given subquestions.

Show answer

Correct answer: -6

Question 15 on its own page

Question 16

+3 marksNumerical answer

How much time(in sec) the arrow will take to reach the ground?

Show answer

Correct answer: 4

Question 16 on its own page

Question 17

+4 marksOne or more correct options

Which of the following options is/are true ?

Select all that apply.

Show answer

Correct answers

Question 17 on its own page

Question 18

+4 marksOne or more correct options

Suppose Nitya wishes to find the minimum cost spanning tree of the graph given below. While finding the minimum cost spanning tree she finds that a few edge weights are missing (x and y) but she is sure that the weight of the minimum cost spanning tree is 15 in the graph.

Based on the above data, answer the given subquestions.

Which of the following are possible values for x and y?

Select all that apply.

A
x = 2, y = 6.
B
x= 4, y = 3.
C
x = 3, y = 4.
D
x = 1, y = 6.

Show answer

Correct answers

A
x = 2, y = 6.
C
x = 3, y = 4.

Question 18 on its own page

Question 19

+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 19 on its own page