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

PDSA · All 2024 papers

50 questions · 200 marks · 2 papers

Answer key

Indian Institute of Technology Madras

BS Degree Programme · Examination & Study Paper

Programming, Data Structures and Algorithms using Python

All 2024 papers

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.

End Term · 22 Dec 2024 (FN)End Term

Q1MCQ4 Marks·Choose one option
Asked 2 times Key ↓
1. AIt finds the smallest element in D from index s1 to s2, both inclusive.
2. BIt reverses the list D between indices s1 and s2, both inclusive
3. CIt performs a merge sort in-place on this list D between indices s1 and s2, both inclusive
4. DIt swaps the elements in D at indices s1 and s2, and leaves the remaining elements unchanged.
Q2MCQ4 Marks·Choose one option
Asked 4 times Key ↓
1. A
2. B
3. C
4. D
Q3MCQ4 Marks·Choose one option
Asked 4 times Key ↓
1. A70
2. B100
3. C35
4. D111
Q4MCQ4 Marks·Choose one option
Asked 2 times Key ↓
1. A0.2
2. B0.4
3. C0.6
4. D0.8
Q5MCQ4 Marks·Choose one option
Asked 3 times Key ↓
1. A
2. B
3. C
4. D
Q6MCQ4 Marks·Choose one option
Asked 5 times Key ↓
1. A
2. B
3. C
4. D
Q7MCQ4 Marks·Choose one option
Key ↓
1. A
2. B
3. C
4. D
Q8MCQ4 Marks·Choose one option
Asked 2 times Key ↓
1. AOnly statement I is true
2. BOnly statement II is true
3. CBoth statements are true
4. DBoth statements are not true
Q9MCQ4 Marks·Choose one option
Asked 2 times Key ↓
Which of the following statement(s) is/are correct about the traversals in a binary search tree? 1. The inorder traversal sorts the elements in descending order. 2. The root of the tree is always the first element of the postorder traversal.
1. AOnly statement 1 is correct
2. BOnly statement 2 is correct
3. CBoth the statements are correct
4. DNone of the statements are correct
Q10MCQ4 Marks·Choose one option
Asked 6 times Key ↓
1. A1
2. B2
3. C3
4. D4
Q11MCQ4 Marks·Choose one option
Asked 4 times Key ↓
1. A
2. B
3. C
4. D
Q12MCQ4 Marks·Choose one option
Asked 4 times Key ↓
1. A
2. B
3. C
4. D
Q13MCQ4 Marks·Choose one option
Asked 5 times Key ↓
1. A
2. B
3. C
4. D
Q14MCQ4 Marks·Choose one option
Key ↓
Which of the following is true about a minimum cut in a network? 1. It is the cut that separates the source and the sink with the minimum number of edges. 2. It is the cut that separates the source and the sink with the minimum sum of capacities of the edges.
1. AOnly statement 1 is true.
2. BOnly statement 2 is true.
3. CBoth statement 1 and 2 are true.
4. DBoth statement 1 and 2 are not true.
Q15MCQ4 Marks·Choose one option
Asked 4 times Key ↓
Consider the following statements. 1. If an NP-hard problem A is polynomial time reducible to another problem B, then B belongs to the NP class. 2. There exists polynomial time checking algorithm for all problems in the class P. Which of the following option is correct?
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
Q16MSQ4 Marks·Choose all correct options
Asked 2 times Key ↓
1. AP Q R S T U V
2. BP R Q V S U T
3. CP Q R S V U T
4. DP R Q S V T U
Q17MSQ4 Marks·Choose all correct options
Asked 4 times Key ↓
1. A(1,2)
2. B(1,4)
3. C(2,4)
4. D(0,3)
5. E(0,2)
Q18NAT4 Marks·Write the number
Asked 3 times Key ↓
Your answer:
Q19NAT4 Marks·Write the number
Asked 6 times Key ↓
Your answer:
Q20NAT4 Marks·Write the number
Key ↓
Your answer:
Q21NAT4 Marks·Write the number
Asked 3 times Key ↓
Your answer:
Q22NAT4 Marks·Write the number
Asked 4 times Key ↓
Your answer:
Q23NAT4 Marks·Write the number
Asked 3 times Key ↓
Your answer:
Q24NAT4 Marks·Write the number
Asked 4 times Key ↓
Your answer:
Q25NAT4 Marks·Write the number
Key ↓
Your answer:

End Term · 22 Dec 2024 (AN)End Term

Q26MCQ4 Marks·Choose one option
Asked 2 times Key ↓
1. A
2. B
3. C
4. D
Q27MCQ4 Marks·Choose one option
Asked 4 times Key ↓
1. A
2. B
3. C
4. D
Q28MCQ4 Marks·Choose one option
Key ↓
1. A
2. B
3. C
4. D
Q29MCQ4 Marks·Choose one option
Asked 4 times Key ↓
1. A55
2. B58
3. C60
4. D48
Q30MCQ4 Marks·Choose one option
Asked 2 times Key ↓
1. A0.5
2. B0.33
3. C0.17
4. D0.83
Q31MCQ4 Marks·Choose one option
Asked 3 times Key ↓
1. A
2. B
3. C
4. D
Q32MCQ4 Marks·Choose one option
Asked 2 times Key ↓
1. A
2. B
3. C
4. D
Q33MCQ4 Marks·Choose one option
Asked 5 times Key ↓
1. A
2. B
3. C
4. D
Q34MCQ4 Marks·Choose one option
Key ↓
1. AOnly 1
2. BOnly 2
3. CBoth 1 and 2
4. DNeither 1 nor 2
Q35MCQ4 Marks·Choose one option
Asked 2 times Key ↓
1. AOnly statement I is true
2. BOnly statement II is true
3. CBoth statements are true
4. DBoth statements are not true
Q36MCQ4 Marks·Choose one option
Key ↓
Consider a complete binary tree with n nodes, where the left and the right subtrees of the root are min heaps. The upper bound to convert the tree to a min heap by an efficient algorithm is _______.
1. A
2. B
3. C
4. D
Q37MCQ4 Marks·Choose one option
Asked 2 times Key ↓
Which of the following statement(s) is/are correct about the traversals in a binary search tree? 1. The root of the tree is always the first element of the inorder traversal. 2. The root of the tree is always the last element of the postorder traversal.
1. AOnly statement 1 is correct
2. BOnly statement 2 is correct
3. CBoth the statements are correct
4. DNone of the statements are correct
Q38MCQ4 Marks·Choose one option
Asked 4 times Key ↓
1. A6
2. B7
3. C8
4. D9
Q39MCQ4 Marks·Choose one option
Asked 4 times Key ↓
1. A
2. B
3. C
4. D
Q40MCQ4 Marks·Choose one option
Asked 4 times Key ↓
1. A
2. B
3. C
4. D
Q41MCQ4 Marks·Choose one option
Asked 4 times Key ↓
1. A1000
2. B1500
3. C2000
4. D2500
Q42MCQ4 Marks·Choose one option
Key ↓
A popular conference is being held, and there are several types of seats: VIP, Regular, and Economy. Each type of seat has a limited number of available spots. Each attendee has a preference for the type of seat they want, and the total number of attendees is greater than the number of available seats. The goal is to allocate the seats to attendees such that each attendee is assigned to their preferred seat type, and no seat type exceeds its capacity. How can the given problem of allocating seats to attendees based on their preferences and seat type capacities be effectively solved?
1. AUsing a greedy algorithm to assign seats based on attendee preferences.
2. BModeling the problem as a maximum flow network with capacities representing seat limits and flows representing the number of attendees assigned to each seat type.
3. CImplementing a first-come, first-serve approach without considering the preferences or seat type capacities.
4. DAssigning all attendees to the VIP seats first and distributing the remaining attendees among Regular and Economy seats.
Q43MCQ4 Marks·Choose one option
Asked 4 times Key ↓
Consider the following statements. 1. If an NP-hard problem A is polynomial time reducible to another problem B, then B belongs to the class NP. 2. If an NP-hard problem A is polynomial time reducible to another problem B, then B is NP- complete. Which of the following option is correct?
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
Q44NAT4 Marks·Write the number
Asked 6 times Key ↓
Your answer:
Q45NAT4 Marks·Write the number
Asked 3 times Key ↓
Your answer:
Q46NAT4 Marks·Write the number
Asked 6 times Key ↓
Your answer:
Q47NAT4 Marks·Write the number
Asked 4 times Key ↓
Your answer:
Q48NAT4 Marks·Write the number
Asked 3 times Key ↓
Your answer:
Q49NAT4 Marks·Write the number
Key ↓
Your answer:
Q50MSQ4 Marks·Choose all correct options
Asked 5 times Key ↓
1. A
2. B
3. C
4. D

Official Key

Master Answer Key & Explanations

Official answer keys from IIT Madras BS past papers. Click any question to review.

Reveal Key

Q1B

Q2B

Q3B

Q4D

Q5B

Q6A

Q7C

Q8C

Q9D

Q10C

Q11D

Q12D

Q13D

Q14B

Q15B

Q16B, D

Q17A, D, E

Q182

Q199

Q2015

Q2131

Q226

Q23127

Q249

Q259

Q26C

Q27D

Q28D

Q29C

Q30A

Q31A

Q32C

Q33C

Q34A

Q35A

Q36D

Q37B

Q38D

Q39C

Q40B

Q41B

Q42B

Q43D

Q448

Q4520

Q4614

Q474

Q48135

Q4910

Q50B, D

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