uiz Space

January 2026 term · Mathematics for Data Science I · BSMA1001

Mathematics for Data Science I End Term: 10 May 2026 (January 2026 term)

The IIT Madras BS Mathematics for Data Science I (Maths 1) End Term paper sat on 10 May 2026, in the January 2026 term: 15 questions for 51 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
15
Marks
51
Duration
180 min
MCQ
4
Written
8
MSQ
3
Take as mock testPractise with answers

Updated

Official paper: Maths1 06 May 26 · No negative marking.

Question 1

+1 markOne correct option
Figure from the original question paper
  1. A

    Instructions has been mentioned above.

  2. B

    This Instructions is just for a reference & not for an evaluation.

Show answer

Correct answer

  • A

    Instructions has been mentioned above.

Question 1 on its own page

Question 2

+3 marksOne correct option
Figure from the original question paper
  1. A

    —

  2. B

    —

  3. C

    —

  4. D

    —

Show answer

Correct answer

  • C

    —

Question 2 on its own page

Question 3

+3 marksOne correct option
Figure from the original question paper
  1. A

    —

  2. B

    —

  3. C

    —

  4. D

    —

Show answer

Correct answer

  • B

    —

Question 3 on its own page

Question 4

+3 marksWritten answer

Inscript

Inscript
Show answer

A written answer, not marked automatically.

Question 4 on its own page

Question 5

+3 marksWritten answer
Figure from the original question paper
Show answer

A written answer, not marked automatically.

Question 5 on its own page

Question 6

+4 marksOne correct option
Figure from the original question paper
  1. A

    .

    .
  2. B
    Figure from the original question paper
  3. C
    Figure from the original question paper
  4. D
    Figure from the original question paper
Show answer

Correct answer

  • A

    .

    .
Question 6 on its own page

Question 7

+4 marksOne or more correct options
Figure from the original question paper

Select all that apply.

  1. A

    has turning points.

  2. B

    has turning points.

  3. C

    as .

  4. D

    as

Show answer

Correct answers

  • A

    has turning points.

  • C

    as .

Question 7 on its own page

Question 8

+4 marksOne or more correct options
Figure from the original question paper

Select all that apply.

  1. 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

  2. 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

  3. 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

  4. 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 8 on its own page

Question 9

+2 marksWritten answer
Figure from the original question paper
Show answer

A written answer, not marked automatically.

Question 9 on its own page

Question 10

+5 marksWritten answer
Figure from the original question paper
Show answer

A written answer, not marked automatically.

Question 10 on its own page

Question 11

+4 marksWritten answer
Figure from the original question paper
Show answer

A written answer, not marked automatically.

Question 11 on its own page

Question 12

+4 marksWritten answer
Figure from the original question paper
Show answer

A written answer, not marked automatically.

Question 12 on its own page

Question 13

+4 marksWritten answer
Figure from the original question paper
Show answer

A written answer, not marked automatically.

Question 13 on its own page

Question 14

+4 marksWritten answer
Figure from the original question paper
Show answer

A written answer, not marked automatically.

Question 14 on its own page

Question 15

+3 marksOne or more correct options

Which of the following statements are correct?

Select all that apply.

  1. A

    Dijkstra’s algorithm can be used to find the minimum weight spanning tree in a graph.

  2. B

    Bellman-Ford algorithm can be used to indicate whether a graph has negative weight cycles or not.

  3. C

    Bellman-Ford algorithm provides a solution for the single source shortest path problem.

  4. D

    Floyd-Warshall algorithm is applicable for graphs that contain negative cycles.

Show answer

Correct answers

  • B

    Bellman-Ford algorithm can be used to indicate whether a graph has negative weight cycles or not.

  • C

    Bellman-Ford algorithm provides a solution for the single source shortest path problem.

Question 15 on its own page