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

PDSA · End Term · 31 Aug 2025 (Forenoon)

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 (Forenoon)

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
Key ↓
1. A
2. B
3. C
4. D
Q2MCQ4 Marks·Choose one option
Asked 2 times Key ↓
1. A
2. B
3. C
4. D
Q3MCQ4 Marks·Choose one option
Asked 2 times Key ↓
1. A2
2. B3
3. C4
4. D5
Q4MCQ4 Marks·Choose one option
Asked 2 times Key ↓
1. A
2. B
3. C
4. D
Q5MCQ4 Marks·Choose one option
Key ↓
1. A
2. B
3. C
Q6MCQ4 Marks·Choose one option
Key ↓
Given a weighted graph where weights of all edges are unique, there is always a unique shortest path from a source to destination in such a graph.
1. ATrue
2. BFalse
Q7MCQ4 Marks·Choose one option
Asked 2 times Key ↓
1. A[65, 50, 55, 30, 40, 35, 45, 10, 20]
2. B[65, 50, 55, 40, 30, 35, 45, 10, 20]
3. C[65, 55, 50, 40, 30, 35, 45, 10, 20]
4. D[65, 50, 55, 40, 30, 35, 45, 20, 10]
Q8MCQ4 Marks·Choose one option
Asked 3 times Key ↓
1. A
2. B
3. C
4. D
Q9MCQ4 Marks·Choose one option
Asked 6 times Key ↓
1. A
2. B
3. C
4. D
Q10MCQ4 Marks·Choose one option
Asked 2 times Key ↓
1. A4
2. B5
3. C6
4. D7
Q11MCQ4 Marks·Choose one option
Asked 4 times Key ↓
1. A
2. B
3. C
4. D
Q12MCQ4 Marks·Choose one option
Key ↓
1. A
2. B
3. C
4. D
Q13MCQ4 Marks·Choose one option
Key ↓
1. A14
2. B15
3. C13
4. D16
Q14MCQ4 Marks·Choose one option
Asked 4 times Key ↓
1. A
2. B
3. C
4. D
Q15MSQ4 Marks·Choose all correct options
Asked 3 times Key ↓
Which of the following sorting algorithms will have the same time complexity irrespective of the sequence of elements in the input?
1. ASelection Sort
2. BMerge Sort
3. CQuick Sort
4. DInsertion Sort
Q16MSQ4 Marks·Choose all correct options
Asked 4 times Key ↓
1. A
2. B
3. C
4. D
Q17MSQ4 Marks·Choose all correct options
Asked 4 times Key ↓
1. A13
2. B8
3. C9
4. D10
5. E11
Q18MSQ4 Marks·Choose all correct options
Asked 3 times Key ↓
1. A10
2. B20
3. C22
4. D25
5. E40
Q19MSQ4 Marks·Choose all correct options
Asked 5 times Key ↓
1. A
2. B
3. C
4. D
5. E
6. F
Q20NAT4 Marks·Write the number
Asked 6 times Key ↓
An undirected graph has 300 edges. What is the minimum number of vertices it must have?
Your answer:
Q21NAT4 Marks·Write the number
Asked 2 times Key ↓
Your answer:
Q22NAT4 Marks·Write the number
Asked 5 times Key ↓
Your answer:
Q23NAT4 Marks·Write the number
Asked 3 times Key ↓
A binary tree has 7 nodes. What is the minimum possible height of this tree (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
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

Q1C

Q2B

Q3D

Q4C

Q5B

Q6B

Q7B

Q8C

Q9B

Q10C

Q11D

Q12A

Q13A

Q14C

Q15A, B

Q16B, D

Q17B, C

Q18A, C, E

Q19A, B, D, E

Q2025

Q218

Q2214

Q233

Q246

Q2576

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