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

PDSA · Most repeated questions

113 questions · 437 marks · 7 papers · 36 question types

Answer key

Indian Institute of Technology Madras

BS Degree Programme · Examination & Study Paper

Programming, Data Structures and Algorithms using Python

Most repeated questions

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.

Type 1 · asked 6 times · Graphs, BFS, DFS & topological sort

Use n(n-1) or n(n-1)/2 to relate edges and vertices of a graph

Q1NAT4 Marks·Write the number
End Term · 22 Dec 2024 (AN)Key ↓
Your answer:
Q2NAT4 Marks·Write the number
End Term · 22 Dec 2024 (FN)Key ↓
Your answer:
Q3MCQ4 Marks·Choose one option
End Term · 13 Apr 2025 (AN)Key ↓
1. A
2. B
3. C
4. D
Q4NAT4 Marks·Write the number
End Term · 31 Aug 2025 (AN)Key ↓
What is the maximum number of edges in a directed graph with 9 vertices?
Your answer:
Q5NAT4 Marks·Write the number
End Term · 31 Aug 2025 (FN)Key ↓
An undirected graph has 300 edges. What is the minimum number of vertices it must have?
Your answer:
Q6NAT3 Marks·Write the number
Quiz 1 · 26 Oct 2025 (AN)Key ↓
Your answer:

Type 2 · asked 6 times · Greedy: scheduling, Huffman, merging

Build a Huffman tree and find code lengths or total bits

Q7NAT4 Marks·Write the number
End Term · 22 Dec 2024 (AN)Key ↓
Your answer:
Q8MCQ4 Marks·Choose one option
End Term · 22 Dec 2024 (FN)Key ↓
1. A1
2. B2
3. C3
4. D4
Q9MCQ4 Marks·Choose one option
End Term · 13 Apr 2025 (AN)Key ↓
1. A1
2. B2
3. C3
4. D4
Q10MCQ3 Marks·Choose one option
Quiz 2 · 3 Aug 2025 (AN)Key ↓
1. A328
2. B82
3. C100
4. D126
Q11MCQ4 Marks·Choose one option
End Term · 31 Aug 2025 (AN)Key ↓
1. A
2. B
3. C
4. D
Q12MCQ4 Marks·Choose one option
End Term · 31 Aug 2025 (FN)Key ↓
1. A
2. B
3. C
4. D

Type 3 · asked 5 times · Shortest paths: Dijkstra & Bellman-Ford

Run Dijkstra's algorithm and find visit order or shortest distances

Q13MCQ4 Marks·Choose one option
End Term · 22 Dec 2024 (AN)Key ↓
1. A
2. B
3. C
4. D
Q14MCQ4 Marks·Choose one option
End Term · 22 Dec 2024 (FN)Key ↓
1. A
2. B
3. C
4. D
Q15NAT4 Marks·Write the number
End Term · 13 Apr 2025 (AN)Key ↓
Your answer:
Q16MCQ4 Marks·Choose one option
Quiz 2 · 3 Aug 2025 (AN)Key ↓
1. A
2. B
3. C
4. D
Q17NAT4 Marks·Write the number
End Term · 31 Aug 2025 (FN)Key ↓
Your answer:

Type 4 · asked 5 times · Linear programming & network flow

Pick valid or invalid constraints for a word-problem LP

Q18MSQ4 Marks·Choose all correct options
End Term · 22 Dec 2024 (AN)Key ↓
1. A
2. B
3. C
4. D
Q19MCQ4 Marks·Choose one option
End Term · 22 Dec 2024 (FN)Key ↓
1. A
2. B
3. C
4. D
Q20MSQ4 Marks·Choose all correct options
End Term · 13 Apr 2025 (AN)Key ↓
1. A
2. B
3. C
4. D
5. E
Q21MSQ4 Marks·Choose all correct options
End Term · 31 Aug 2025 (AN)Key ↓
1. A
2. B
3. C
4. D
5. E
6. F
Q22MSQ4 Marks·Choose all correct options
End Term · 31 Aug 2025 (FN)Key ↓
1. A
2. B
3. C
4. D
5. E
6. F

Type 5 · asked 4 times · Searching & sorting

Find which element could have been the quicksort pivot after first partition

Q23MCQ4 Marks·Choose one option
End Term · 22 Dec 2024 (AN)Key ↓
1. A55
2. B58
3. C60
4. D48
Q24MCQ4 Marks·Choose one option
End Term · 22 Dec 2024 (FN)Key ↓
1. A70
2. B100
3. C35
4. D111
Q25MSQ4 Marks·Choose all correct options
End Term · 31 Aug 2025 (AN)Key ↓
1. A17
2. B37
3. C62
4. D57
5. E82
Q26MSQ4 Marks·Choose all correct options
End Term · 31 Aug 2025 (FN)Key ↓
1. A13
2. B8
3. C9
4. D10
5. E11

Type 6 · asked 4 times · Complexity, growth & recurrences

Find the time complexity of a loop-based function

Q27MCQ4 Marks·Choose one option
End Term · 22 Dec 2024 (AN)Key ↓
1. A
2. B
3. C
4. D
Q28MCQ4 Marks·Choose one option
End Term · 22 Dec 2024 (FN)Key ↓
1. A
2. B
3. C
4. D
Q29MCQ4 Marks·Choose one option
End Term · 31 Aug 2025 (AN)Key ↓
1. A
2. B
3. C
4. D
Q30MCQ3 Marks·Choose one option
Quiz 1 · 26 Oct 2025 (AN)Key ↓
1. A
2. B
3. C
4. D

Type 7 · asked 4 times · Divide & conquer

Count the inversions (or inversion pairs) in a list

Q31MCQ4 Marks·Choose one option
End Term · 22 Dec 2024 (AN)Key ↓
1. A6
2. B7
3. C8
4. D9
Q32MSQ4 Marks·Choose all correct options
End Term · 22 Dec 2024 (FN)Key ↓
1. A(1,2)
2. B(1,4)
3. C(2,4)
4. D(0,3)
5. E(0,2)
Q33MCQ4 Marks·Choose one option
End Term · 13 Apr 2025 (AN)Key ↓
1. A8
2. B6
3. C4
4. D2
Q34NAT3 Marks·Write the number
Quiz 2 · 3 Aug 2025 (AN)Key ↓
Your answer:

Type 8 · asked 4 times · Complexity, growth & recurrences

Solve a recurrence like T(n)=aT(n/b)+f(n) to get its complexity

Q35MCQ4 Marks·Choose one option
End Term · 22 Dec 2024 (AN)Key ↓
1. A
2. B
3. C
4. D
Q36MCQ4 Marks·Choose one option
End Term · 22 Dec 2024 (FN)Key ↓
1. A
2. B
3. C
4. D
Q37MCQ4 Marks·Choose one option
End Term · 13 Apr 2025 (AN)Key ↓
1. A
2. B
3. C
4. D
Q38MCQ3 Marks·Choose one option
Quiz 2 · 3 Aug 2025 (AN)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

Type 9 · asked 4 times · Dynamic programming

Count grid paths from (0,0) to (m,n) with DP, with or without blocks

Q39MCQ4 Marks·Choose one option
End Term · 22 Dec 2024 (AN)Key ↓
1. A
2. B
3. C
4. D
Q40NAT4 Marks·Write the number
End Term · 22 Dec 2024 (FN)Key ↓
Your answer:
Q41NAT4 Marks·Write the number
End Term · 13 Apr 2025 (AN)Key ↓
Your answer:
Q42NAT4 Marks·Write the number
End Term · 31 Aug 2025 (AN)Key ↓
Your answer:

Type 10 · asked 4 times · Dynamic programming

Matrix chain multiplication: best order or minimum multiplications

Q43MCQ4 Marks·Choose one option
End Term · 22 Dec 2024 (AN)Key ↓
1. A1000
2. B1500
3. C2000
4. D2500
Q44MCQ4 Marks·Choose one option
End Term · 22 Dec 2024 (FN)Key ↓
1. A
2. B
3. C
4. D
Q45MCQ4 Marks·Choose one option
End Term · 31 Aug 2025 (AN)Key ↓
1. A
2. B
3. C
4. D
Q46MCQ4 Marks·Choose one option
End Term · 31 Aug 2025 (FN)Key ↓
1. A
2. B
3. C
4. D

Type 11 · asked 4 times · Intractability & NP-completeness

Reason about P, NP, NP-hard and NP-complete reductions

Q47MCQ4 Marks·Choose one option
End Term · 22 Dec 2024 (AN)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
Q48MCQ4 Marks·Choose one option
End Term · 22 Dec 2024 (FN)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
Q49MCQ4 Marks·Choose one option
End Term · 31 Aug 2025 (AN)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
Q50MCQ4 Marks·Choose one option
End Term · 31 Aug 2025 (FN)Key ↓
1. A
2. B
3. C
4. D

Type 12 · asked 4 times · Greedy: scheduling, Huffman, merging

Activity selection: max number of meetings in one room

Q51NAT4 Marks·Write the number
End Term · 22 Dec 2024 (AN)Key ↓
Your answer:
Q52NAT4 Marks·Write the number
End Term · 22 Dec 2024 (FN)Key ↓
Your answer:
Q53NAT4 Marks·Write the number
End Term · 31 Aug 2025 (AN)Key ↓
Your answer:
Q54NAT4 Marks·Write the number
End Term · 31 Aug 2025 (FN)Key ↓
Your answer:

Type 13 · asked 4 times · Complexity, growth & recurrences

Arrange functions in order of asymptotic growth

Q55MCQ4 Marks·Choose one option
End Term · 13 Apr 2025 (AN)Key ↓
1. A
2. B
3. C
4. D
Q56MSQ4 Marks·Choose all correct options
End Term · 31 Aug 2025 (AN)Key ↓
1. A
2. B
3. C
4. D
Q57MSQ4 Marks·Choose all correct options
End Term · 31 Aug 2025 (FN)Key ↓
1. A
2. B
3. C
4. D
Q58MCQ3 Marks·Choose one option
Quiz 1 · 26 Oct 2025 (AN)Key ↓
1. A
2. B
3. C
4. D

Type 14 · asked 3 times · Recursion, linked lists, stacks & queues

Trace a recursive function that pops and re-pushes a stack or queue

Q59MCQ4 Marks·Choose one option
End Term · 22 Dec 2024 (AN)Key ↓
1. A
2. B
3. C
4. D
Q60MCQ4 Marks·Choose one option
End Term · 22 Dec 2024 (FN)Key ↓
1. A
2. B
3. C
4. D
Q61MCQ3 Marks·Choose one option
Quiz 1 · 26 Oct 2025 (AN)Key ↓
1. A
2. B
3. C
4. D

Type 15 · asked 3 times · Binary trees, BST & AVL trees

Find min or max nodes / max height of an AVL tree

Q62NAT4 Marks·Write the number
End Term · 22 Dec 2024 (AN)Key ↓
Your answer:
Q63NAT4 Marks·Write the number
End Term · 22 Dec 2024 (FN)Key ↓
Your answer:
Q64MCQ4 Marks·Choose one option
End Term · 13 Apr 2025 (AN)Key ↓
1. A4
2. B5
3. C11
4. D12

Type 16 · asked 3 times · Greedy: scheduling, Huffman, merging

Optimal merge of sorted lists: total comparisons in worst case

Q65NAT4 Marks·Write the number
End Term · 22 Dec 2024 (AN)Key ↓
Your answer:
Q66NAT4 Marks·Write the number
End Term · 22 Dec 2024 (FN)Key ↓
Your answer:
Q67NAT4 Marks·Write the number
End Term · 13 Apr 2025 (AN)Key ↓
Your answer:

Type 17 · asked 3 times · Searching & sorting

Trace binary search: iterations, comparisons or value of high

Q68NAT4 Marks·Write the number
End Term · 22 Dec 2024 (FN)Key ↓
Your answer:
Q69MCQ4 Marks·Choose one option
End Term · 13 Apr 2025 (AN)Key ↓
1. A2
2. B3
3. C4
4. D5
Q70MCQ3 Marks·Choose one option
Quiz 1 · 26 Oct 2025 (AN)Key ↓
1. A35, 51, 39, 47
2. B35, 51, 47
3. C35, 51, 43, 47
4. D35, 55, 39, 47
5. ENone of these

Type 18 · asked 3 times · Searching & sorting

Recall time complexity of a sorting algorithm in a given case

Q71MCQ4 Marks·Choose one option
End Term · 13 Apr 2025 (AN)Key ↓
What is the worst case time complexity of Selection Sort ?
1. A
2. B
3. C
4. D
Q72MCQ4 Marks·Choose one option
End Term · 31 Aug 2025 (AN)Key ↓
1. A
2. B
3. C
4. D
Q73MSQ4 Marks·Choose all correct options
End Term · 31 Aug 2025 (FN)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

Type 19 · asked 3 times · Graphs, BFS, DFS & topological sort

State the time complexity of BFS, Dijkstra or Kruskal

Q74MCQ4 Marks·Choose one option
End Term · 13 Apr 2025 (AN)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
Q75MCQ4 Marks·Choose one option
End Term · 31 Aug 2025 (AN)Key ↓
1. A
2. B
3. C
4. D
Q76MCQ4 Marks·Choose one option
End Term · 31 Aug 2025 (FN)Key ↓
1. A
2. B
3. C
4. D

Type 20 · asked 3 times · Heaps & priority queues

Heap after delete_max/delete_min then insert

Q77MCQ4 Marks·Choose one option
End Term · 13 Apr 2025 (AN)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]
Q78MCQ4 Marks·Choose one option
Quiz 2 · 3 Aug 2025 (AN)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]
Q79MCQ4 Marks·Choose one option
End Term · 31 Aug 2025 (AN)Key ↓
1. A
2. B
3. C
4. D

Type 21 · asked 3 times · Binary trees, BST & AVL trees

Insert into an AVL tree and find the result or the leaves

Q80MCQ3 Marks·Choose one option
Quiz 2 · 3 Aug 2025 (AN)Key ↓
1. A
2. B
3. C
4. D
Q81MSQ4 Marks·Choose all correct options
End Term · 31 Aug 2025 (AN)Key ↓
1. A2
2. B3
3. C4
4. D5
5. E9
Q82MSQ4 Marks·Choose all correct options
End Term · 31 Aug 2025 (FN)Key ↓
1. A10
2. B20
3. C22
4. D25
5. E40

Type 22 · asked 3 times · Binary trees, BST & AVL trees

Min height or max nodes of a binary tree

Q83NAT3 Marks·Write the number
Quiz 2 · 3 Aug 2025 (AN)Key ↓
Your answer:
Q84NAT4 Marks·Write the number
End Term · 31 Aug 2025 (AN)Key ↓
What is the minimum possible height of a binary tree with 12 nodes (assuming the empty tree height is 0)?
Your answer:
Q85NAT4 Marks·Write the number
End Term · 31 Aug 2025 (FN)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:

Type 23 · asked 2 times · Hashing & linear probing

Find probability the next key lands at an index with linear probing

Q86MCQ4 Marks·Choose one option
End Term · 22 Dec 2024 (AN)Key ↓
1. A0.5
2. B0.33
3. C0.17
4. D0.83
Q87MCQ4 Marks·Choose one option
End Term · 22 Dec 2024 (FN)Key ↓
1. A0.2
2. B0.4
3. C0.6
4. D0.8

Type 24 · asked 2 times · Hashing & linear probing

Find a possible key insertion order for a linear-probing hash table

Q88MSQ4 Marks·Choose all correct options
End Term · 13 Apr 2025 (AN)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
Q89MSQ4 Marks·Choose all correct options
End Term · 31 Aug 2025 (AN)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

Type 25 · asked 2 times · Hashing & linear probing

Find the index where a key is stored with linear probing

Q90MCQ4 Marks·Choose one option
End Term · 31 Aug 2025 (FN)Key ↓
1. A2
2. B3
3. C4
4. D5
Q91NAT3 Marks·Write the number
Quiz 1 · 26 Oct 2025 (AN)Key ↓
Your answer:

Type 26 · asked 2 times · Recursion, linked lists, stacks & queues

Say what a recursive function on a list does

Q92MCQ4 Marks·Choose one option
End Term · 22 Dec 2024 (AN)Key ↓
1. A
2. B
3. C
4. D
Q93MCQ4 Marks·Choose one option
End Term · 22 Dec 2024 (FN)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.

Type 27 · asked 2 times · Graphs, BFS, DFS & topological sort

BFS: compare d(s,u) and d(s,v) when u is visited before v

Q94MCQ4 Marks·Choose one option
End Term · 22 Dec 2024 (AN)Key ↓
1. A
2. B
3. C
4. D
Q95MCQ4 Marks·Choose one option
End Term · 31 Aug 2025 (FN)Key ↓
1. A
2. B
3. C
4. D

Type 28 · asked 2 times · Binary trees, BST & AVL trees

Check bounds linking height, internal, leaf and total nodes of a binary tree

Q96MCQ4 Marks·Choose one option
End Term · 22 Dec 2024 (AN)Key ↓
1. AOnly statement I is true
2. BOnly statement II is true
3. CBoth statements are true
4. DBoth statements are not true
Q97MCQ4 Marks·Choose one option
End Term · 22 Dec 2024 (FN)Key ↓
1. AOnly statement I is true
2. BOnly statement II is true
3. CBoth statements are true
4. DBoth statements are not true

Type 29 · asked 2 times · Binary trees, BST & AVL trees

True/false about inorder and postorder traversal of a BST

Q98MCQ4 Marks·Choose one option
End Term · 22 Dec 2024 (AN)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
Q99MCQ4 Marks·Choose one option
End Term · 22 Dec 2024 (FN)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

Type 30 · asked 2 times · Divide & conquer

Count inversions between two rankings of movies

Q100MCQ4 Marks·Choose one option
End Term · 31 Aug 2025 (AN)Key ↓
1. A4
2. B5
3. C6
4. D7
Q101MCQ4 Marks·Choose one option
End Term · 31 Aug 2025 (FN)Key ↓
1. A4
2. B5
3. C6
4. D7

Type 31 · asked 2 times · Graphs, BFS, DFS & topological sort

Pick valid (or invalid) topological orderings of a DAG

Q102MSQ4 Marks·Choose all correct options
End Term · 22 Dec 2024 (FN)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
Q103MSQ3 Marks·Choose all correct options
Quiz 1 · 26 Oct 2025 (AN)Key ↓
1. A
2. B
3. C
4. D
5. E

Type 32 · asked 2 times · Heaps & priority queues

Max-heap: find last inserted element or heap before last insert

Q104MCQ3 Marks·Choose one option
Quiz 2 · 3 Aug 2025 (AN)Key ↓
1. A71
2. B36
3. C37
4. D29
Q105MCQ4 Marks·Choose one option
End Term · 31 Aug 2025 (FN)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]

Type 33 · asked 2 times · Minimum spanning trees

Find the weight of the minimum spanning tree

Q106NAT4 Marks·Write the number
End Term · 13 Apr 2025 (AN)Key ↓
Your answer:
Q107NAT3 Marks·Write the number
Quiz 2 · 3 Aug 2025 (AN)Key ↓
Your answer:

Type 34 · asked 2 times · Minimum spanning trees

Count MSTs plus their weight (alpha + beta)

Q108NAT4 Marks·Write the number
End Term · 31 Aug 2025 (AN)Key ↓
Your answer:
Q109NAT4 Marks·Write the number
End Term · 31 Aug 2025 (FN)Key ↓
Your answer:

Type 35 · asked 2 times · Divide & conquer

Trace median of medians on a given list

Q110NAT4 Marks·Write the number
End Term · 13 Apr 2025 (AN)Key ↓
Your answer:
Q111MCQ3 Marks·Choose one option
Quiz 2 · 3 Aug 2025 (AN)Key ↓
1. A15
2. B9
3. C14
4. D17

Type 36 · asked 2 times · Recursion, linked lists, stacks & queues

Code to insert or delete the first node of a linked list

Q112MCQ4 Marks·Choose one option
End Term · 31 Aug 2025 (AN)Key ↓
1. A
2. B
3. C
4. D
Q113MCQ4 Marks·Choose one option
End Term · 31 Aug 2025 (FN)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

Q18

Q29

Q3A

Q472

Q525

Q6190

Q714

Q8C

Q9C

Q10D

Q11C

Q12B

Q13C

Q14A

Q156

Q16B

Q1714

Q18B, D

Q19D

Q20A, D, E

Q21A, B, C, D

Q22A, B, D, E

Q23C

Q24B

Q25A, B, E

Q26B, C

Q27D

Q28B

Q29B

Q30B

Q31D

Q32A, D, E

Q33D

Q3412

Q35C

Q36D

Q37B

Q38C

Q39B

Q409

Q4118

Q4266

Q43B

Q44D

Q45C

Q46D

Q47D

Q48B

Q49B

Q50C

Q514

Q526

Q535

Q546

Q55D

Q56B, C

Q57B, D

Q58B

Q59A

Q60B

Q61C

Q6220

Q6331

Q64B

Q65135

Q66127

Q67164

Q682

Q69B

Q70C

Q71A

Q72D

Q73A, B

Q74B

Q75B

Q76C

Q77B

Q78B

Q79D

Q80B

Q81A, D, E

Q82A, C, E

Q8331

Q844

Q853

Q86A

Q87D

Q88A, B, C

Q89A, D

Q90D

Q916

Q92C

Q93B

Q94C

Q95C

Q96A

Q97C

Q98B

Q99D

Q100B

Q101C

Q102B, D

Q103B, E

Q104D

Q105B

Q10615

Q10715

Q10810

Questions and answer keys are reproduced from the official IIT Madras BS papers. Topics and repeated question types are BTechi’s own grouping. BTechi is not affiliated with IIT Madras.