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

PDSA · Quiz 1 · 26 Oct 2025 (Afternoon)

17 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 1 · 26 Oct 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 4 times Key ↓
1. A
2. B
3. C
4. D
Q2MCQ3 Marks·Choose one option
Asked 4 times Key ↓
1. A
2. B
3. C
4. D
Q3MCQ3 Marks·Choose one option
Asked 3 times Key ↓
1. A35, 51, 39, 47
2. B35, 51, 47
3. C35, 51, 43, 47
4. D35, 55, 39, 47
5. ENone of these
Q4MCQ3 Marks·Choose one option
Key ↓
1. A2
2. B3
3. C4
4. D5
Q5MCQ3 Marks·Choose one option
Key ↓
1. A
2. B
3. C
4. D
Q6MCQ3 Marks·Choose one option
Key ↓
1. AOnly Statement 1
2. BOnly Statement 2
3. COnly Statement 3
4. DStatements 1 and 2
5. EStatements 2 and 3
Q7MCQ3 Marks·Choose one option
Asked 3 times Key ↓
1. A
2. B
3. C
4. D
Q8MCQ3 Marks·Choose one option
Key ↓
1. A
2. B
3. C
4. D
Q9MCQ2 Marks·Choose one option
Key ↓
1. A1-a, 2-b, 3-c, 4-d
2. B1-b, 2-a, 3-d, 4-c
3. C1-a, 2-b, 3-d, 4-c
4. D1-c, 2-b, 3-a, 4-d
Q10MSQ3 Marks·Choose all correct options
Asked 2 times Key ↓
1. A
2. B
3. C
4. D
5. E
Q11MSQ3 Marks·Choose all correct options
Key ↓
Consider a connected, undirected graph G with n vertices. A Breadth-First Search (BFS) traversal is performed starting from a source vertex s. Let d(s, v) denote the shortest distance (in terms of number of edges) from s to vertex v. Which of the following statements is true about the BFS traversal?
1. AAll vertices at distance k from s are visited before any vertex at distance k + 1 from s.
2. BOnce a vertex is visited, it is never visited again during the traversal.
3. CBFS may fail to visit some vertices, even if the graph is connected.
4. DThe time complexity of BFS using an adjacency list representation is O(n^2).
Q12NAT3 Marks·Write the number
Key ↓
Your answer:
Q13NAT3 Marks·Write the number
Key ↓
Your answer:
Q14NAT3 Marks·Write the number
Asked 2 times Key ↓
Your answer:
Q15NAT3 Marks·Write the number
Asked 6 times Key ↓
Your answer:
Q16NAT3 Marks·Write the number
Key ↓
Your answer:
Q17NAT3 Marks·Write the number
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

Q4D

Q5B

Q6A

Q7C

Q8A

Q9B

Q10B, E

Q11A, B

Q122

Q1324

Q146

Q15190

Q164

Q172

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