Question 2
[12, 18, 20, 19, 32, 37, 27, 26, 29]
[12, 18, 20, 19, 32, 27, 37, 29, 26]
[12, 18, 19, 20, 27, 32, 37, 29, 26]
[12, 20, 18, 19, 32, 27, 37, 26, 29]
Question 3
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?
Statements i and ii
Statements ii and iii
Statements i and iii
All statements i, ii and iii
13 more questions in this paper
Sign in with Google — it is free — to see every question with its answer and explanation, practise it in learning mode, or take it as a timed mock test.
More on the PDSA Quiz 2 3 Aug 2025 paper
The IIT Madras BS Programming, Data Structures and Algorithms using Python (PDSA) Quiz 2 paper sat on 3 Aug 2025, in the May 2025 term: 16 questions for 50 marks in 120 minutes. The first 3 questions are below. Sign in with Google — it is free — to see the whole paper with its answers and explanations, in learning mode or as a timed mock test.
| Feature | PDSA Quiz 2 3 Aug 2025 at a glance |
|---|---|
| Term | May 2025 term |
| Subject | Programming, Data Structures and Algorithms using Python |
| Course code | BSCS2002 |
| Questions | 16 |
| Marks | 50 |
| Duration | 120 min |
| MCQ | 10 |
| MSQ | 3 |
| Numerical | 3 |
| Official paper | IIT M DEGREE AN EXAM QDB2 03 Aug 2025 |
| Negative marking | No negative marking. |
| Updated |