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

PDSA · End Term · 31 Aug 2025 (Afternoon)

25 questions · 100 marks · 90 min

Answer key Take as mock

Indian Institute of Technology Madras

BS Degree Programme · Examination & Study Paper

Programming, Data Structures and Algorithms using Python

End Term · 31 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 4 times Key ↓
1. A
2. B
3. C
4. D
Q2MCQ4 Marks·Choose one option
Asked 3 times Key ↓
1. A
2. B
3. C
4. D
Q3MCQ4 Marks·Choose one option
Asked 2 times Key ↓
1. A
2. B
3. C
4. D
Q4MCQ4 Marks·Choose one option
Key ↓
Consider the following statements: 1. While creating a DFS tree for a directed graph, among non-tree edges, only back edges correspond to cycles. 2. The depth of any DFS tree rooted at a vertex is at least as much as the depth of any BFS tree rooted at the same vertex. Choose the correct option.
1. AOnly statement 1 is true
2. BOnly statement 2 is true
3. CBoth statements 1 and 2 are true
4. DBoth statements 1 and 2 are false
Q5MCQ4 Marks·Choose one option
Key ↓
Given a graph where all edges have positive weights, the shortest path identified by Dijkstra's and Bellman Ford algorithm may be different but path weight would be same.
1. ATRUE
2. BFALSE
Q6MCQ4 Marks·Choose one option
Key ↓
1. A3, 5, 4, 10
2. B3, 5, 5, 9
3. C2, 5, 5, 10
4. D2, 5, 4, 9
Q7MCQ4 Marks·Choose one option
Asked 3 times Key ↓
1. A
2. B
3. C
4. D
Q8MCQ4 Marks·Choose one option
Asked 6 times Key ↓
1. A
2. B
3. C
4. D
Q9MCQ4 Marks·Choose one option
Asked 2 times Key ↓
1. A4
2. B5
3. C6
4. D7
Q10MCQ4 Marks·Choose one option
Asked 4 times Key ↓
1. A
2. B
3. C
4. D
Q11MCQ4 Marks·Choose one option
Key ↓
1. A
2. B
3. C
4. D
Q12MCQ4 Marks·Choose one option
Key ↓
1. AEdges {cd, bd}
2. BEdges {cb, cd, bt}
3. CEdges {ab, cd, cb}
4. DEdges {bt, bd}
Q13MCQ4 Marks·Choose one option
Asked 4 times Key ↓
1. AOnly statement 1 is correct
2. BOnly statement 2 is correct
3. CBoth the statements are correct
4. DBoth the statements are wrong
Q14MCQ4 Marks·Choose one option
Asked 3 times Key ↓
1. A
2. B
3. C
4. D
Q15MSQ4 Marks·Choose all correct options
Asked 4 times Key ↓
1. A
2. B
3. C
4. D
Q16MSQ4 Marks·Choose all correct options
Asked 4 times Key ↓
1. A17
2. B37
3. C62
4. D57
5. E82
Q17MSQ4 Marks·Choose all correct options
Asked 2 times Key ↓
1. A23, 36, 72, 12, 54, 83
2. B36, 72, 23, 54, 12, 83
3. C36, 23, 72, 12, 83, 54
4. D36, 23, 72, 12, 54, 83
Q18MSQ4 Marks·Choose all correct options
Key ↓
1. A1
2. B5
3. C3
4. D4
5. E6
6. F7
Q19MSQ4 Marks·Choose all correct options
Asked 3 times Key ↓
1. A2
2. B3
3. C4
4. D5
5. E9
Q20MSQ4 Marks·Choose all correct options
Asked 5 times Key ↓
1. A
2. B
3. C
4. D
5. E
6. F
Q21NAT4 Marks·Write the number
Asked 6 times Key ↓
What is the maximum number of edges in a directed graph with 9 vertices?
Your answer:
Q22NAT4 Marks·Write the number
Asked 2 times Key ↓
Your answer:
Q23NAT4 Marks·Write the number
Asked 3 times Key ↓
What is the minimum possible height of a binary tree with 12 nodes (assuming the empty tree height is 0)?
Your answer:
Q24NAT4 Marks·Write the number
Asked 4 times Key ↓
Your answer:
Q25NAT4 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

Q2D

Q3A

Q4C

Q5A

Q6D

Q7D

Q8C

Q9B

Q10C

Q11C

Q12C

Q13B

Q14B

Q15B, C

Q16A, B, E

Q17A, D

Q18A, C, E

Q19A, D, E

Q20A, B, C, D

Q2172

Q2210

Q234

Q245

Q2566

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