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

Maths I · Shortest paths & spanning trees

BSMA1001 · 9 questions · 35 marks · 4 papers

Answer key

Indian Institute of Technology Madras

BS Degree Programme · Examination & Study Paper

BSMA1001 · Mathematics for Data Science I

Shortest paths & spanning trees

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.

End Term · 31 Aug 2025 (FN)End Term

Q1MCQ4 Marks·Choose one option
Key ↓
Suppose Dijkstra’s algorithm is run on the graph below, starting at node A. In what order do the shortest distances to the other vertices get finalized?
1. A
2. B
3. C
4. D
Q2NAT4 Marks·Write the number
Asked 2 times Key ↓
Your answer:

End Term · 13 Apr 2025 (FN)End Term

Q3MCQ3 Marks·Choose one option
Asked 2 times Key ↓
Which of the following options is true?
1. AThe minimum cost-spanning tree obtained by Prim’s Algorithm is always the same as obtained by Kruskal’s Algorithm.
2. BThe minimum cost-spanning tree is not a tree.
3. CThe cost of the spanning tree obtained by Prim’s Algorithm is the same as obtained by Kruskal’s Algorithm.
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.
Read the passage below, then answer Q4
Suppose Nitya wishes to find the minimum cost spanning tree of the graph given below. While finding the minimum cost spanning tree she finds that a few edge weights are missing (x and y) but she is sure that the weight of the minimum cost spanning tree is 15 in the graph.
Based on the above data, answer the given subquestions.
Q4MSQ4 Marks·Choose all correct options
Asked 2 times Key ↓
Which of the following are possible values for x and y?
1. Ax = 2, y = 6.
2. Bx= 4, y = 3.
3. Cx = 3, y = 4.
4. Dx = 1, y = 6.

End Term · 13 Apr 2025 (AN)End Term

Q5MCQ3 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.
Read the passage below, then answer Q6
Based on the above data, answer the given subquestions.
Q6MSQ4 Marks·Choose all correct options
Asked 2 times Key ↓
1. A
2. B
3. C
4. D

End Term · 22 Dec 2024 (FN)End Term

Q7MSQ4 Marks·Choose all correct options
Key ↓
1. A
2. B
3. C
4. D
Q8MCQ4 Marks·Choose one option
Key ↓
1. A
2. B
3. C
4. D
Q9NAT5 Marks·Write the number
Asked 2 times Key ↓
Your answer:

Official Key

Master Answer Key & Explanations

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

Reveal Key

Q1A

Q213

Q3C

Q4A, C

Q5A

Q6B, C

Q7A, C

Q8D

Q923

Questions and answer keys are reproduced from the official IIT Madras BS papers. Topics and repeated question types are BTechi’s own grouping. BTechi is not affiliated with IIT Madras.