BTechibtechi.in
Loading Loading
Free IIT Madras BS notes, PYQs and mock tests at btechi.in

Maths I · End Term · 13 Apr 2025 (Afternoon)

BSMA1001 · 16 questions · 50 marks · 90 min

Answer key Take as mock

Indian Institute of Technology Madras

BS Degree Programme · Examination & Study Paper

BSMA1001 · Mathematics for Data Science I

End Term · 13 Apr 2025 (Afternoon)

Official Paper

Examination Instructions & Guidelines

Solve on notebook/paper first before checking solutions.
MCQ: Exactly 1 option is correct. Negative marking applies.
MSQ: One or more options correct. Select all to score.
NAT: Numerical response. No negative marking.
Scientific calculator allowed for all calculations.
Official answer key is sealed at the end of this sheet.

Q1MCQ3 Marks·Choose one option
Asked 2 times Key ↓
Which of the following options is true?
1. AThe cost of the spanning tree obtained by Prim’s Algorithm is the same as obtained by Kruskal’s Algorithm.
2. BThe minimum cost-spanning tree obtained by Prim’s Algorithm is the same as obtained by Kruskal’s Algorithm.
3. CThe minimum cost-spanning tree is not a tree.
4. DIf the weight of each edge in a graph is equal, then the total cost of the graph is equal to the cost of the minimum cost-spanning tree.
Q2MCQ3 Marks·Choose one option
Asked 3 times Key ↓
1. A
2. B
3. C
4. D
Q3MSQ3 Marks·Choose all correct options
Asked 3 times Key ↓
Which of the following statements is (are) correct?
1. A
2. B
3. C
4. D
Q4MSQ3 Marks·Choose all correct options
Asked 6 times Key ↓
1. A
2. B
3. C
4. D
Q5MSQ4 Marks·Choose all correct options
Asked 2 times Key ↓
1. A
2. B
3. C
4. D
Q6MSQ4 Marks·Choose all correct options
Asked 2 times Key ↓
1. AIf we perform Breadth-First Search at node 0, then one of the possible orders in which the nodes will be visited is 01246573.
2. BIf we perform Depth First Search at node 7, then one of the possible order in which the nodes will be visited is 74356012
3. CIf we perform Breadth-First Search at node 0, then one of the possible orders in which the nodes will be visited is 01264537.
4. DIf we perform Depth First Search at node 0, then one of the possible orders in which the nodes will be visited is 76435012.
Q7NAT2 Marks·Write the number
Asked 5 times Key ↓
Your answer:
Q8NAT3 Marks·Write the number
Asked 4 times Key ↓
Your answer:
Read the passage below, then answer Q9–Q10
Q9NAT3 Marks·Write the number
Asked 5 times Key ↓
Your answer:
Q10NAT3 Marks·Write the number
Asked 3 times Key ↓
Your answer:
Read the passage below, then answer Q11–Q12
Based on the above data, answer the given subquestions.
Q11MSQ4 Marks·Choose all correct options
Asked 2 times Key ↓
1. A
2. B
3. C
4. D
Q12NAT3 Marks·Write the number
Asked 4 times Key ↓
What is the minimum number of colors required to properly color the vertices of the given graph such that no two adjacent vertices share the same color?
Your answer:
Read the passage below, then answer Q13–Q16
Q13MCQ3 Marks·Choose one option
Asked 4 times Key ↓
1. ATRUE
2. BFALSE
Q14NAT3 Marks·Write the number
Asked 4 times Key ↓
Your answer:
Q15MCQ3 Marks·Choose one option
Asked 6 times Key ↓
1. ATRUE
2. BFALSE
Q16MCQ3 Marks·Choose one option
Asked 6 times Key ↓
1. ATRUE
2. BFALSE

Official Key

Master Answer Key & Explanations

Official answer keys from IIT Madras BS past papers. Click any question to review.

Reveal Key

Q1A

Q2A

Q3B, C, D

Q4A, D

Q5B, C

Q6B, C

Q70

Q85

Q917

Q100.1 to 0.3

Q11B, C

Q124

Q13A

Q141

Q15B

Q16A

Questions and answer keys are reproduced from the official IIT Madras BS papers. BTechi is not affiliated with IIT Madras.