Indian Institute of Technology Madras
BS Degree Programme · Examination & Study Paper
Programming, Data Structures and Algorithms using Python
Minimum spanning trees
Official Paper
Examination Instructions & Guidelines
- Solve on notebook/paper first before checking solutions.
- MCQ: Exactly 1 option is correct. Negative marking applies.
- 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
- A
- B
- C
- D
- A
- Q2NAT4 Marks·Write the number
Your answer:
End Term · 31 Aug 2025 (AN)End Term
- Q3NAT4 Marks·Write the number
Your answer:
Quiz 2 · 3 Aug 2025 (AN)Quiz 2
- Q4MCQ3 Marks·Choose one option
Consider the given statements below about Prim's algorithm's behaviour and properties. i. The choice of the starting vertex can lead to different Minimum Spanning Trees if multiple MSTs exist with the same total weight. ii. Prim's algorithm first sorts all edges in the graph by weight. iii. The algorithm maintains a set of visited vertices and, at each step, selects the minimum weight edge connecting a visited vertex to an unvisited vertex. Which of the given statements are True?
- AStatements i and ii
- BStatements ii and iii
- CStatements i and iii
- DAll statements i, ii and iii
- Q5NAT3 Marks·Write the number
Your answer:
End Term · 13 Apr 2025 (AN)End Term
- Q6MCQ4 Marks·Choose one option
- A5
- B6
- C7
- D8
- Q7NAT4 Marks·Write the number
Your answer:
End Term · 22 Dec 2024 (FN)End Term
- Q8MCQ4 Marks·Choose one option
- A
- B
- C
- D
- A
End Term · 22 Dec 2024 (AN)End Term
- Q9MCQ4 Marks·Choose one option
- AOnly 1
- BOnly 2
- CBoth 1 and 2
- DNeither 1 nor 2