Consider the following adjacency matrix | | A | B | C | D | E | |---|---|---|---|---|---| | A | 0 | 1 | 0 | 1 | 1 | | B | 1 | 0 | 1 | 0 | 1 | | C | 0 | 1 | 0 | 0 | 1 | | D | 1 | 0 | 0 | 0 | 1 | | E | 1 | 1 | 1 | 1 | 0 | which represents graph G which has 5 vertices A, B, C, D and E. Which of the following is true about the graph G?

(B) The total number of edges in G are 7.

(A) The number of vertices in G of degree 3 are 3.

(C) The total number of edges in G are 14.

Figure from the original question paper

(C) Option figure from the original question paper

(D) Option figure from the original question paper

(A) Option figure from the original question paper

(B) Option figure from the original question paper

Figure from the original question paper

(C) The vertex of this parabola is at (-1, -9).

(D) y- intercept of the given parabola is -8.

(A) f is one-one on its domain.

(B) f has an inverse on its domain.

Figure from the original question paper

(D) Option 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

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

May 2024 term · Mathematics for Data Science I · BSMA1001

Mathematics for Data Science I End Term: 1 September 2024 (May 2024 term)

The IIT Madras BS Mathematics for Data Science I (Maths 1) End Term paper sat on 1 Sept 2024, in the May 2024 term: 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
MSQ: 6
Numerical: 6
MCQ: 4

Take as mock test Practise with answers

Updated 25 Sept 2026

Official paper: IIT M FOUNDATION DIPLOMA FN EXAM QDF1 01 Sep 2024 · No negative marking.

Question 1

+4 marksOne or more correct options

Which of the following is (are) correct?

Select all that apply.

A
Floyd-Warshall algorithm is used for all pair shortest paths.
B
The Shortest path problem is not applicable to a graph with a negative weight cycle.
C
Bellman-Ford algorithm is used for single source shortest path.
D
Dijkstra’s algorithm is used for all pair shortest paths.

Show answer

Correct answers

A
Floyd-Warshall algorithm is used for all pair shortest paths.
B
The Shortest path problem is not applicable to a graph with a negative weight cycle.
C
Bellman-Ford algorithm is used for single source shortest path.

Question 1 on its own page

Question 2

+3 marksOne or more correct options

Consider the following adjacency matrix

	$A$	$B$	$C$	$D$	$E$
$A$	0	1	0	1	1
$B$	1	0	1	0	1
$C$	0	1	0	0	1
$D$	1	0	0	0	1
$E$	1	1	1	1	0

which represents graph $G$ which has 5 vertices $A, B, C, D$ and $E$ .

Which of the following is true about the graph $G$ ?

Select all that apply.

A
The number of vertices in G of degree 3 are 3.
B
The total number of edges in G are 7.
C
The total number of edges in G are 14.
D
There is a cycle in G.

Show answer

Correct answers

B
The total number of edges in G are 7.
D
There is a cycle in G.

Question 2 on its own page

Question 3

+3 marksOne or more correct options

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.

A
f is one-one on its domain.
B
f has an inverse on its domain.
C
The vertex of this parabola is at (-1, -9).
D
y- intercept of the given parabola is -8.

Show answer

Correct answers

C
The vertex of this parabola is at (-1, -9).
D
y- intercept of the given parabola is -8.

Question 4 on its own page

Question 5

+3 marksOne or more correct options

Select all that apply.

A
R1 is not transitive.
B
R2 is symmetric.
C
R1 is symmetric.
D
R2 is transitive.

Show answer

Correct answers

B
R2 is symmetric.
C
R1 is symmetric.

Question 5 on its own page

Question 6

+4 marksNumerical answer

Show answer

Correct answer: 3

Question 6 on its own page

Question 7

+4 marksNumerical answer

You have been closely monitoring your bike's mileage recently. Here is a table showing two rows representing the amount paid for fuel(in ₹) and the corresponding mileage (in Km). Consider $y$ as the amount paid and $x$ as the corresponding mileage in Km. You have noted down the distance traveled each time when the fuel meter falls back to a fixed reference mark and predicted that the equation of the best fit line is $y = 5x - 21$ . What will be the value of SSE w.r.t the best fit line?

Amount paid (in ₹)	80	50	60	100	48
Distance (in Km)	20	15	16	25	14

Table: 1

Show answer

Correct answer: 35

Question 7 on its own page

Question 8

+4 marksOne correct option

Consider a weighted graph $G$ with 7 vertices $\{$ rows and columns are in the order $V_1, V_2, V_3, V_4, V_5, V_6, V_7\}$ , which is represented by the following adjacency matrix.

Use the following information for given sub-questions

$\begin{bmatrix} 0 & 24 & 0 & 0 & 36 & 0 & 28 \\ 24 & 0 & 0 & 32 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 4 & 12 \\ 0 & 32 & 0 & 0 & 8 & 0 & 0 \\ 36 & 0 & 0 & 8 & 0 & 0 & 0 \\ 0 & 0 & 4 & 0 & 0 & 0 & 20 \\ 28 & 0 & 12 & 0 & 0 & 20 & 0 \end{bmatrix}.$

Suppose we perform Prim’s algorithm on the graph G starting from vertex V1 to find an MCST. Then the order in which the vertices are added is

Show answer

Correct answer

Question 8 on its own page

Question 9

+2 marksNumerical answer

Consider a weighted graph $G$ with 7 vertices $\{$ rows and columns are in the order $V_1, V_2, V_3, V_4, V_5, V_6, V_7\}$ , which is represented by the following adjacency matrix.