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

PDSA · All 2025 papers

108 questions · 400 marks · 5 papers

Answer key

Indian Institute of Technology Madras

BS Degree Programme · Examination & Study Paper

Programming, Data Structures and Algorithms using Python

All 2025 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.

Quiz 1 · 26 Oct 2025 (AN)Quiz 1

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:

End Term · 31 Aug 2025 (FN)End Term

Q18MCQ4 Marks·Choose one option
Key ↓
1. A
2. B
3. C
4. D
Q19MCQ4 Marks·Choose one option
Asked 2 times Key ↓
1. A
2. B
3. C
4. D
Q20MCQ4 Marks·Choose one option
Asked 2 times Key ↓
1. A2
2. B3
3. C4
4. D5
Q21MCQ4 Marks·Choose one option
Asked 2 times Key ↓
1. A
2. B
3. C
4. D
Q22MCQ4 Marks·Choose one option
Key ↓
1. A
2. B
3. C
Q23MCQ4 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
Q24MCQ4 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]
Q25MCQ4 Marks·Choose one option
Asked 3 times Key ↓
1. A
2. B
3. C
4. D
Q26MCQ4 Marks·Choose one option
Asked 6 times Key ↓
1. A
2. B
3. C
4. D
Q27MCQ4 Marks·Choose one option
Asked 2 times Key ↓
1. A4
2. B5
3. C6
4. D7
Q28MCQ4 Marks·Choose one option
Asked 4 times Key ↓
1. A
2. B
3. C
4. D
Q29MCQ4 Marks·Choose one option
Key ↓
1. A
2. B
3. C
4. D
Q30MCQ4 Marks·Choose one option
Key ↓
1. A14
2. B15
3. C13
4. D16
Q31MCQ4 Marks·Choose one option
Asked 4 times Key ↓
1. A
2. B
3. C
4. D
Q32MSQ4 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
Q33MSQ4 Marks·Choose all correct options
Asked 4 times Key ↓
1. A
2. B
3. C
4. D
Q34MSQ4 Marks·Choose all correct options
Asked 4 times Key ↓
1. A13
2. B8
3. C9
4. D10
5. E11
Q35MSQ4 Marks·Choose all correct options
Asked 3 times Key ↓
1. A10
2. B20
3. C22
4. D25
5. E40
Q36MSQ4 Marks·Choose all correct options
Asked 5 times Key ↓
1. A
2. B
3. C
4. D
5. E
6. F
Q37NAT4 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:
Q38NAT4 Marks·Write the number
Asked 2 times Key ↓
Your answer:
Q39NAT4 Marks·Write the number
Asked 5 times Key ↓
Your answer:
Q40NAT4 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:
Q41NAT4 Marks·Write the number
Asked 4 times Key ↓
Your answer:
Q42NAT4 Marks·Write the number
Key ↓
Your answer:

End Term · 31 Aug 2025 (AN)End Term

Q43MCQ4 Marks·Choose one option
Asked 4 times Key ↓
1. A
2. B
3. C
4. D
Q44MCQ4 Marks·Choose one option
Asked 3 times Key ↓
1. A
2. B
3. C
4. D
Q45MCQ4 Marks·Choose one option
Asked 2 times Key ↓
1. A
2. B
3. C
4. D
Q46MCQ4 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
Q47MCQ4 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
Q48MCQ4 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
Q49MCQ4 Marks·Choose one option
Asked 3 times Key ↓
1. A
2. B
3. C
4. D
Q50MCQ4 Marks·Choose one option
Asked 6 times Key ↓
1. A
2. B
3. C
4. D
Q51MCQ4 Marks·Choose one option
Asked 2 times Key ↓
1. A4
2. B5
3. C6
4. D7
Q52MCQ4 Marks·Choose one option
Asked 4 times Key ↓
1. A
2. B
3. C
4. D
Q53MCQ4 Marks·Choose one option
Key ↓
1. A
2. B
3. C
4. D
Q54MCQ4 Marks·Choose one option
Key ↓
1. AEdges {cd, bd}
2. BEdges {cb, cd, bt}
3. CEdges {ab, cd, cb}
4. DEdges {bt, bd}
Q55MCQ4 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
Q56MCQ4 Marks·Choose one option
Asked 3 times Key ↓
1. A
2. B
3. C
4. D
Q57MSQ4 Marks·Choose all correct options
Asked 4 times Key ↓
1. A
2. B
3. C
4. D
Q58MSQ4 Marks·Choose all correct options
Asked 4 times Key ↓
1. A17
2. B37
3. C62
4. D57
5. E82
Q59MSQ4 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
Q60MSQ4 Marks·Choose all correct options
Key ↓
1. A1
2. B5
3. C3
4. D4
5. E6
6. F7
Q61MSQ4 Marks·Choose all correct options
Asked 3 times Key ↓
1. A2
2. B3
3. C4
4. D5
5. E9
Q62MSQ4 Marks·Choose all correct options
Asked 5 times Key ↓
1. A
2. B
3. C
4. D
5. E
6. F
Q63NAT4 Marks·Write the number
Asked 6 times Key ↓
What is the maximum number of edges in a directed graph with 9 vertices?
Your answer:
Q64NAT4 Marks·Write the number
Asked 2 times Key ↓
Your answer:
Q65NAT4 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:
Q66NAT4 Marks·Write the number
Asked 4 times Key ↓
Your answer:
Q67NAT4 Marks·Write the number
Asked 4 times Key ↓
Your answer:

Quiz 2 · 3 Aug 2025 (AN)Quiz 2

Q68MCQ4 Marks·Choose one option
Asked 5 times Key ↓
1. A
2. B
3. C
4. D
Q69MCQ4 Marks·Choose one option
Asked 3 times Key ↓
1. A[12, 18, 20, 19, 32, 37, 27, 26, 29]
2. B[12, 18, 20, 19, 32, 27, 37, 29, 26]
3. C[12, 18, 19, 20, 27, 32, 37, 29, 26]
4. D[12, 20, 18, 19, 32, 27, 37, 26, 29]
Q70MCQ3 Marks·Choose one option
Key ↓
Consider the given statements below about Prim's algorithm's behaviour and properties. i. The choice of the starting vertex can lead to different Minimum Spanning Trees if multiple MSTs exist with the same total weight. ii. Prim's algorithm first sorts all edges in the graph by weight. iii. The algorithm maintains a set of visited vertices and, at each step, selects the minimum weight edge connecting a visited vertex to an unvisited vertex. Which of the given statements are True?
1. AStatements i and ii
2. BStatements ii and iii
3. CStatements i and iii
4. DAll statements i, ii and iii
Q71MCQ3 Marks·Choose one option
Key ↓
1. A7
2. B8
3. C9
4. D10
Q72MCQ3 Marks·Choose one option
Asked 2 times Key ↓
1. A71
2. B36
3. C37
4. D29
Q73MCQ3 Marks·Choose one option
Key ↓
Consider the following statements and select the correct option. i. The greedy technique always gives an optimized solution to the problem. ii. Bellman-Ford and Floyd-Warshal algorithms use the greedy technique to solve the path problems.
1. AStatements (i) and (ii) are false.
2. BStatements (i) and (ii) are true.
3. CStatement (i) is true and Statement (ii) is false.
4. DStatement (i) is false and Statement (ii) is true.
Q74MCQ3 Marks·Choose one option
Asked 3 times Key ↓
1. A
2. B
3. C
4. D
Q75MCQ3 Marks·Choose one option
Asked 6 times Key ↓
1. A328
2. B82
3. C100
4. D126
Q76MCQ3 Marks·Choose one option
Asked 4 times Key ↓
1. AA-3, B-1, C-2, D-4
2. BA-4, B-1, C-3, D-2
3. CA-4, B-1, C-2, D-3
4. DA-1, B-3, C-2, D-4
Q77MCQ3 Marks·Choose one option
Asked 2 times Key ↓
1. A15
2. B9
3. C14
4. D17
Q78MSQ3 Marks·Choose all correct options
Key ↓
Which of the following is/are True about Bellman-Ford algorithm?
1. AIt can handle disconnected graphs.
2. BThe shortest path is not stabilized, if there are negative cycles.
3. CIt can handle negative edge weights, but not negative cycles.
4. DIt uses the greedy approach to find the shortest path.
Q79MSQ3 Marks·Choose all correct options
Key ↓
1. A
2. B
3. C
4. D
Q80MSQ3 Marks·Choose all correct options
Key ↓
Which of the following statements are true about the finding the closest pair of points using divide and conquer strategy?
1. A
2. B
3. C
4. D
Q81NAT3 Marks·Write the number
Asked 2 times Key ↓
Your answer:
Q82NAT3 Marks·Write the number
Asked 3 times Key ↓
Your answer:
Q83NAT3 Marks·Write the number
Asked 4 times Key ↓
Your answer:

End Term · 13 Apr 2025 (AN)End Term

Q84MCQ4 Marks·Choose one option
Asked 4 times Key ↓
1. A
2. B
3. C
4. D
Q85MCQ4 Marks·Choose one option
Asked 3 times Key ↓
1. A2
2. B3
3. C4
4. D5
Q86MCQ4 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
Q87MCQ4 Marks·Choose one option
Asked 6 times Key ↓
1. A
2. B
3. C
4. D
Q88MCQ4 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
Q89MCQ4 Marks·Choose one option
Key ↓
1. A8
2. B7
3. C6
4. D5
Q90MCQ4 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]
Q91MCQ4 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
Q92MCQ4 Marks·Choose one option
Asked 6 times Key ↓
1. A1
2. B2
3. C3
4. D4
Q93MCQ4 Marks·Choose one option
Asked 4 times Key ↓
1. A
2. B
3. C
4. D
Q94MCQ4 Marks·Choose one option
Asked 4 times Key ↓
1. A8
2. B6
3. C4
4. D2
Q95MCQ4 Marks·Choose one option
Key ↓
1. A5
2. B6
3. C7
4. D8
Q96MCQ4 Marks·Choose one option
Asked 3 times Key ↓
1. A4
2. B5
3. C11
4. D12
Q97MSQ4 Marks·Choose all correct options
Key ↓
1. A
2. B
3. C
4. D
Q98MSQ4 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
Q99MSQ4 Marks·Choose all correct options
Key ↓
Which of the following statement is/are false?
1. A
2. B
3. C
4. D
Q100MSQ4 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.
Q101MSQ4 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
Q102MSQ4 Marks·Choose all correct options
Asked 5 times Key ↓
1. A
2. B
3. C
4. D
5. E
Q103NAT4 Marks·Write the number
Asked 5 times Key ↓
Your answer:
Q104NAT4 Marks·Write the number
Asked 2 times Key ↓
Your answer:
Q105NAT4 Marks·Write the number
Asked 3 times Key ↓
Your answer:
Q106NAT4 Marks·Write the number
Asked 2 times Key ↓
Your answer:
Q107NAT4 Marks·Write the number
Asked 4 times Key ↓
Your answer:
Q108NAT4 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

Q18C

Q19B

Q20D

Q21C

Q22B

Q23B

Q24B

Q25C

Q26B

Q27C

Q28D

Q29A

Q30A

Q31C

Q32A, B

Q33B, D

Q34B, C

Q35A, C, E

Q36A, B, D, E

Q3725

Q388

Q3914

Q403

Q416

Q4276

Q43B

Q44D

Q45A

Q46C

Q47A

Q48D

Q49D

Q50C

Q51B

Q52C

Q53C

Q54C

Q55B

Q56B

Q57B, C

Q58A, B, E

Q59A, D

Q60A, C, E

Q61A, D, E

Q62A, B, C, D

Q6372

Q6410

Q654

Q665

Q6766

Q68B

Q69B

Q70C

Q71A

Q72D

Q73A

Q74B

Q75D

Q76C

Q77A

Q78A, B, C

Q79A, B

Q80A, B, C

Q8115

Q8231

Q8312

Q84D

Q85B

Q86A

Q87A

Q88B

Q89C

Q90B

Q91C

Q92C

Q93B

Q94D

Q95D

Q96B

Q97B, D

Q98A, B, C

Q99A, C, D

Q100B, D

Q101D, E

Q102A, D, E

Q1036

Q10415

Q105164

Q1068

Q10718

Q10810

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