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

PDSA · End Term · 13 Apr 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 · 13 Apr 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. A2
2. B3
3. C4
4. D5
Q3MCQ4 Marks·Choose one option
Asked 3 times Key ↓
What is the worst case time complexity of Selection Sort ?
1. A
2. B
3. C
4. D
Q4MCQ4 Marks·Choose one option
Asked 6 times Key ↓
1. A
2. B
3. C
4. D
Q5MCQ4 Marks·Choose one option
Asked 3 times Key ↓
Consider a graph G with V vertices and E edges represented using an adjacency list. What is the worst case complexity for Breadth First Search?
1. A
2. B
3. C
4. D
Q6MCQ4 Marks·Choose one option
Key ↓
1. A8
2. B7
3. C6
4. D5
Q7MCQ4 Marks·Choose one option
Asked 3 times Key ↓
1. A[41, 29, 26, 17, 15, 10, 9, 12, 11]
2. B[41, 29, 26, 17, 15, 10, 9, 11, 12]
3. C[41, 29, 26, 15, 17, 10, 9, 11, 12]
4. D[41, 29, 26, 15, 17, 10, 9, 12, 11]
Q8MCQ4 Marks·Choose one option
Key ↓
While inserting the elements [13, 7, 26, 33, 5, 10, 12, 11, 9] in an empty binary search tree (BST) in the sequence shown, the element at maximum depth is__.
1. A33
2. B9
3. C11
4. D5
Q9MCQ4 Marks·Choose one option
Asked 6 times Key ↓
1. A1
2. B2
3. C3
4. D4
Q10MCQ4 Marks·Choose one option
Asked 4 times Key ↓
1. A
2. B
3. C
4. D
Q11MCQ4 Marks·Choose one option
Asked 4 times Key ↓
1. A8
2. B6
3. C4
4. D2
Q12MCQ4 Marks·Choose one option
Key ↓
1. A5
2. B6
3. C7
4. D8
Q13MCQ4 Marks·Choose one option
Asked 3 times Key ↓
1. A4
2. B5
3. C11
4. D12
Q14MSQ4 Marks·Choose all correct options
Key ↓
1. A
2. B
3. C
4. D
Q15MSQ4 Marks·Choose all correct options
Asked 2 times Key ↓
1. A22, 33, 44, 52, 26, 63
2. B22, 26, 33, 44, 52, 63
3. C26, 44, 33, 22, 52, 63
4. D33, 44, 52, 22, 26, 63
5. E44, 33, 52, 22, 26, 63
Q16MSQ4 Marks·Choose all correct options
Key ↓
Which of the following statement is/are false?
1. A
2. B
3. C
4. D
Q17MSQ4 Marks·Choose all correct options
Key ↓
Which of the below statements are true about Dynamic programming?
1. AIncreases both time complexity and space complexity.
2. BIt replaces recursion with iteration, so there are no stack overflow errors.
3. CIncreases time complexity and decreases space complexity.
4. DIt avoids computing sub-problems more than once.
Q18MSQ4 Marks·Choose all correct options
Key ↓
Which of these correspond to non-polynomial time complexity?
1. A
2. B
3. C
4. D
5. E
Q19MSQ4 Marks·Choose all correct options
Asked 5 times Key ↓
1. A
2. B
3. C
4. D
5. E
Q20NAT4 Marks·Write the number
Asked 5 times Key ↓
Your answer:
Q21NAT4 Marks·Write the number
Asked 2 times Key ↓
Your answer:
Q22NAT4 Marks·Write the number
Asked 3 times Key ↓
Your answer:
Q23NAT4 Marks·Write the number
Asked 2 times Key ↓
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

Q1D

Q2B

Q3A

Q4A

Q5B

Q6C

Q7B

Q8C

Q9C

Q10B

Q11D

Q12D

Q13B

Q14B, D

Q15A, B, C

Q16A, C, D

Q17B, D

Q18D, E

Q19A, D, E

Q206

Q2115

Q22164

Q238

Q2418

Q2510

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