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

PDSA · Quiz 2 · 3 Aug 2025 (Afternoon)

16 questions · 50 marks · 60 min

Answer key Take as mock

Indian Institute of Technology Madras

BS Degree Programme · Examination & Study Paper

Programming, Data Structures and Algorithms using Python

Quiz 2 · 3 Aug 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.

Q1MCQ4 Marks·Choose one option
Asked 5 times Key ↓
1. A
2. B
3. C
4. D
Q2MCQ4 Marks·Choose one option
Asked 3 times Key ↓
1. A[12, 18, 20, 19, 32, 37, 27, 26, 29]
2. B[12, 18, 20, 19, 32, 27, 37, 29, 26]
3. C[12, 18, 19, 20, 27, 32, 37, 29, 26]
4. D[12, 20, 18, 19, 32, 27, 37, 26, 29]
Q3MCQ3 Marks·Choose one option
Key ↓
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?
1. AStatements i and ii
2. BStatements ii and iii
3. CStatements i and iii
4. DAll statements i, ii and iii
Q4MCQ3 Marks·Choose one option
Key ↓
1. A7
2. B8
3. C9
4. D10
Q5MCQ3 Marks·Choose one option
Asked 2 times Key ↓
1. A71
2. B36
3. C37
4. D29
Q6MCQ3 Marks·Choose one option
Key ↓
Consider the following statements and select the correct option. i. The greedy technique always gives an optimized solution to the problem. ii. Bellman-Ford and Floyd-Warshal algorithms use the greedy technique to solve the path problems.
1. AStatements (i) and (ii) are false.
2. BStatements (i) and (ii) are true.
3. CStatement (i) is true and Statement (ii) is false.
4. DStatement (i) is false and Statement (ii) is true.
Q7MCQ3 Marks·Choose one option
Asked 3 times Key ↓
1. A
2. B
3. C
4. D
Q8MCQ3 Marks·Choose one option
Asked 6 times Key ↓
1. A328
2. B82
3. C100
4. D126
Q9MCQ3 Marks·Choose one option
Asked 4 times Key ↓
1. AA-3, B-1, C-2, D-4
2. BA-4, B-1, C-3, D-2
3. CA-4, B-1, C-2, D-3
4. DA-1, B-3, C-2, D-4
Q10MCQ3 Marks·Choose one option
Asked 2 times Key ↓
1. A15
2. B9
3. C14
4. D17
Q11MSQ3 Marks·Choose all correct options
Key ↓
Which of the following is/are True about Bellman-Ford algorithm?
1. AIt can handle disconnected graphs.
2. BThe shortest path is not stabilized, if there are negative cycles.
3. CIt can handle negative edge weights, but not negative cycles.
4. DIt uses the greedy approach to find the shortest path.
Q12MSQ3 Marks·Choose all correct options
Key ↓
1. A
2. B
3. C
4. D
Q13MSQ3 Marks·Choose all correct options
Key ↓
Which of the following statements are true about the finding the closest pair of points using divide and conquer strategy?
1. A
2. B
3. C
4. D
Q14NAT3 Marks·Write the number
Asked 2 times Key ↓
Your answer:
Q15NAT3 Marks·Write the number
Asked 3 times Key ↓
Your answer:
Q16NAT3 Marks·Write the number
Asked 4 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

Q1B

Q2B

Q3C

Q4A

Q5D

Q6A

Q7B

Q8D

Q9C

Q10A

Q11A, B, C

Q12A, B

Q13A, B, C

Q1415

Q1531

Q1612

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