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

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

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

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

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

Figure from the original question paper

(B) Option figure from the original question paper

(A) Option figure from the original question paper

(C) Option figure from the original question paper

(D) Option figure from the original question paper

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

(A) Option figure from the original question paper

Question text with a graph of a function f(x) marked at (-10,0), (-4,0), (0,0), (4,0)

(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

May 2021 term · Mathematics for Data Science I · BSMA1001

Maths 1 Quiz 1: 11 July 2021, Set POD21QZBQPA (May 2021 term)

The IIT Madras BS Mathematics for Data Science I (Maths 1) Quiz 1 paper sat on 11 Jul 2021, in the May 2021 term, set POD21QZBQPA: 10 questions for 25 marks in 120 minutes. Every question is below with its answer. Take it as a timed mock test to be marked, or read it through first.

Questions: 10
Marks: 25
Duration: 120 min
MSQ: 6
MCQ: 3
Numerical: 1

Take as mock test Practise with answers

Updated 25 Sept 2026

Official paper: IIT M QUIZ EXAM POD21QZBQPB AN 11 July 2021 · No negative marking.

Question 1

+2 marksOne or more correct options

Select all that apply.

Show answer

Correct answers

Question 1 on its own page

Question 2

+2 marksOne or more correct options

Select all that apply.

A
–4
B
–1
C
1
D
4

Show answer

Correct answers

A
–4
C
1

Question 2 on its own page

Question 3

+3 marksOne or more correct options

Select all that apply.

A
If we perform Depth First Search at node 0, then one of the possible order in which the nodes will be visited is 05142367
B
If we perform Depth First Search at node 0, then one of the possible order in which the nodes will be visited is 01453672
C
If we perform Breadth First Search at node 0, then one of the possible order in which the nodes will be visited is 01542367
D
If we perform Depth First Search at node 0, then one of the possible order in which the nodes will be visited is 01543267

Show answer

Correct answers

A
If we perform Depth First Search at node 0, then one of the possible order in which the nodes will be visited is 05142367
B
If we perform Depth First Search at node 0, then one of the possible order in which the nodes will be visited is 01453672
C
If we perform Breadth First Search at node 0, then one of the possible order in which the nodes will be visited is 01542367

Question 3 on its own page

Question 4

+2.5 marksOne correct option

Show answer

Correct answer

Question 4 on its own page

Question 5

+2.5 marksNumerical answer

A curious student of the IITM Online Degree Program wants to fit the data given in Table: 1. Using the knowledge of Maths1 course, he came to an understanding that the model will be of the form $f(x) = \log_2 (x^2 - 4x + 8)^k$ . The student wants to calculate the value of $k$ such that the SSE will be minimum. What is the value of $k$ ?

x	y
0	3
2	2
4	3

Table: 1

NOTE: Enter your answer to the nearest integer.

Show answer

Correct answer: 1

Question 5 on its own page

Question 6

+3 marksOne or more correct options

Select all that apply.

Show answer

Correct answers

Question 6 on its own page

Question 7

+2 marksOne or more correct options

Select all that apply.

Show answer

Correct answers

Question 7 on its own page

Question 8

+3 marksOne or more correct options

Which of the following options is(are) CORRECT?

Select all that apply.

A
A graph can be drawn with 5 vertices, 5 edges, and the degree of each vertex being 2.
B
6,2,2,2,2,2,2 can be a possible listing of the degrees of a graph with 7 vertices.
C
5,5,2,2,1,1 can be a possible listing of the degrees of a graph with 6 vertices.
D
A graph can be drawn with 6 vertices, 9 edges, and the degree of each vertex being 3.
E
In an Adjacency matrix A, if all the entries are non-zero, then the graph represented by A is a simple graph.

Show answer

Correct answers

A
A graph can be drawn with 5 vertices, 5 edges, and the degree of each vertex being 2.
B
6,2,2,2,2,2,2 can be a possible listing of the degrees of a graph with 7 vertices.
D
A graph can be drawn with 6 vertices, 9 edges, and the degree of each vertex being 3.

Question 8 on its own page

Question 9

+2.5 marksOne correct option

Below table shows the adjacency list w.r.t incoming edges of a directed graph $G$ . Which of the following tables shows the adjacency list w.r.t outgoing edges of the graph $G$ ?

0	{ }
1	{0}
2	{0,1}
3	{2}
4	{2,3}
5	{3}
6	{4}
7	{8,4}
8	{3}

Adjacency list w.r.t incoming edges

Show answer

Correct answer

Question 9 on its own page

Question 10

+2.5 marksOne correct option

Which of the following graphs has the smallest vertex cover?

Show answer

Correct answer

Question 10 on its own page