Quiz Space

May 2021 term · Mathematics for Data Science I · BSMA1001

Maths 1 Quiz 1: 11 July 2021, Set POD21QZBQPB (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 POD21QZBQPB: 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
5
MCQ
4
Numerical
1

Updated

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.

  1. A
  2. B
  3. C
  4. D
Show answer

Correct answers

  • B
  • C

Question 2

+2 marksOne or more correct options

Choose the correct options with respect to the graph of a function f(x) shown below.

Select all that apply.

  1. A
  2. B
  3. C
  4. D
Show answer

Correct answers

  • A
  • D

Question 3

+2.5 marksOne correct option
  1. A
  2. B
  3. C
  4. D
Show answer

Correct answer

  • D

Question 4

+2.5 marksOne correct option
  1. A
  2. B
  3. C
  4. D
Show answer

Correct answer

  • D

Question 5

+2.5 marksOne correct option

Which of the following graphs has the minimum colouring?

  1. A
  2. B
  3. C
  4. D
Show answer

Correct answer

  • C

Question 6

+2.5 marksNumerical answer

NOTE: Enter your answer to the nearest integer.

Show answer

Correct answer: 2

Question 7

+2 marksOne correct option
  1. A

    –2

  2. B

    –3

  3. C

    1

  4. D

    –4

Show answer

Correct answer

  • B

    –3

Question 8

+3 marksOne or more correct options

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

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

  4. D

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

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.

  • D

    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 9

+3 marksOne or more correct options

Select all that apply.

  1. A
  2. B
  3. C
  4. D
Show answer

Correct answers

  • A
  • B
  • D

Question 10

+3 marksOne or more correct options

Which of the following options is(are) CORRECT?

Select all that apply.

  1. A

    A graph can be drawn with 6 vertices, 5 edges, and the degree of each vertex being 2.

  2. B

    6,2,2,2,2,2,2 can be a possible listing of the degrees of a graph with 7 vertices.

  3. C

    5,5,2,2,2,2 can be a possible listing of the degrees of a graph with 6 vertices.

  4. D

    A graph can be drawn with 6 vertices, 9 edges, and the degree of each vertex being 3.

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

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