Question 1
+2 marksOne or more correct optionsSelect all that apply.
- A
- B
- C
- D
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.
Correct answers
Choose the correct options with respect to the graph of a function f(x) shown below.
Correct answers
Correct answer
Correct answer
Which of the following graphs has the minimum colouring?
Correct answer
NOTE: Enter your answer to the nearest integer.
Correct answer: 2
–2
–3
1
–4
Correct answer
–3
If we perform Depth First Search at node 0, then one of the possible order in which the nodes will be visited is 05142367.
If we perform Depth First Search at node 0, then one of the possible order in which the nodes will be visited is 01425367.
If we perform Breadth First Search at node 0, then one of the possible order in which the nodes will be visited is 01425367.
If we perform Breadth First Search at node 0, then one of the possible order in which the nodes will be visited is 01542367.
Correct answers
If we perform Depth First Search at node 0, then one of the possible order in which the nodes will be visited is 05142367.
If we perform Breadth First Search at node 0, then one of the possible order in which the nodes will be visited is 01542367.
Correct answers
Which of the following options is(are) CORRECT?
A graph can be drawn with 6 vertices, 5 edges, and the degree of each vertex being 2.
6,2,2,2,2,2,2 can be a possible listing of the degrees of a graph with 7 vertices.
5,5,2,2,2,2 can be a possible listing of the degrees of a graph with 6 vertices.
A graph can be drawn with 6 vertices, 9 edges, and the degree of each vertex being 3.
In an Adjacency matrix A, if all the entries are non-zero, then the graph represented by A is a simple graph.
Correct answers
6,2,2,2,2,2,2 can be a possible listing of the degrees of a graph with 7 vertices.
5,5,2,2,2,2 can be a possible listing of the degrees of a graph with 6 vertices.
A graph can be drawn with 6 vertices, 9 edges, and the degree of each vertex being 3.