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

AI Search · Most repeated questions

61 questions · 61 marks · 4 papers · 27 question types

Answer key

Indian Institute of Technology Madras

BS Degree Programme · Examination & Study Paper

AI: Search Methods for Problem Solving

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 3 times · Branch & Bound and A* search

Find the path returned by Best First Search

Read the passage below, then answer Q1
SEARCH
The figure shows a map on a uniform grid where each tile is 1x1 in size.
The start node is S and the goal node is G.
The MoveGen function returns nodes in alphabetical order.
Use Manhattan Distance as the heuristic function.
Tie-breaker: If several nodes have the same cost, use node labels to break the tie.
Based on the above data, answer the given subquestions.
Q1Short answer1 Mark·Write the answer
End Term · 31 Aug 2025 (AN)Key ↓
What is the path found by the Best First Search algorithm? Enter the path as a comma separated list of node labels. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: S,X,Y,Z
Your answer:
Read the passage below, then answer Q2
SEARCH
Based on the above data, answer the given subquestions.
Q2Short answer1 Mark·Write the answer
End Term · 31 Aug 2025 (FN)Key ↓
What is the path found by the Best First Search algorithm? Enter the path as a comma separated list of node labels. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: S,X,Y,Z
Your answer:
Read the passage below, then answer Q3
SEARCH
The MoveGen function and the heuristic function for a state space is provided below. Take S as the start node and G as the goal node.
When required use alphabetical order to break ties.
When we say a node is inspected/expanded/refined it means: the node is picked up from OPEN, and goal test is called, if goal test fails then MoveGen is called and, depending on the algorithm, the neighbours are selectively placed in OPEN.
Assume that the RemoveSeen procedure will drop the neighbours that are already present in the OPEN or CLOSED list.
Based on the above data, answer the given subquestions.
Q3Short answer1 Mark·Write the answer
Quiz 1 · 26 Oct 2025 (AN)Key ↓
What is the path found by Best First Search? Enter the path as a comma separated list of node labels. Enter NIL if a path to goal is not found. NO SPACES, TABS, DOTS, BRACKETS, PARENTHESIS OR UNWANTED CHARACTERS. Answer Format: S,X,Y,G
Your answer:

Type 2 · asked 3 times · Branch & Bound and A* search

Decide whether the heuristic is admissible for the given graph

Read the passage below, then answer Q4
SEARCH
Figure shows an infinite state space with finite branching, where S is the start node and G is the goal node, and G is at the center of a unit circle, and the remaining nodes are on the unit circle. (Note: circular grid is shown by dashed lines which are not part of the state space.)
Take the radial distance as the heuristic value:
h(G)=0; h(S)=1; and h(Ak)=1, for all k in {1, 2, . . .}.
MoveGen returns neighbours in alphabetical order (A1,A2,..., G,S).
Tie-breaker: use alphabetical order to break ties.
Note: sum(1, a, a^2, a^3, ..., a^(n-1)) is given by ((1 - a^n)/(1 - a)).
Based on the above data, answer the given subquestions
Q4MCQ1 Mark·Choose one option
Quiz 2 · 3 Aug 2025 (AN)Key ↓
Is the heuristic admissible in the given state space?
1. AYes
2. BNo
3. CCannot be determined
Read the passage below, then answer Q5
SEARCH
The figure shows a map on a uniform grid where each tile is 1x1 in size.
The start node is S and the goal node is G.
The MoveGen function returns nodes in alphabetical order.
Use Manhattan Distance as the heuristic function.
Tie-breaker: If several nodes have the same cost, use node labels to break the tie.
Based on the above data, answer the given subquestions.
Q5MCQ1 Mark·Choose one option
End Term · 31 Aug 2025 (AN)Key ↓
Select the correct statement(s) about the given graph.
1. AHeuristic is admissible.
2. BHeuristic is not admissible.
3. CHeuristic is admissible in some cases and not admissible in other cases.
4. DThere is not enough information to determine admissibility.
Read the passage below, then answer Q6
SEARCH
Based on the above data, answer the given subquestions.
Q6MCQ1 Mark·Choose one option
End Term · 31 Aug 2025 (FN)Key ↓
Select the correct statement(s) about the given graph.
1. AHeuristic is admissible.
2. BHeuristic is not admissible.
3. CHeuristic is admissible in some cases and not admissible in other cases.
4. DThere is not enough information to determine admissibility.

Type 3 · asked 3 times · Game trees: Minimax, Alpha-Beta, SSS*

List the leaf nodes in MAX's best strategy

Read the passage below, then answer Q7
GAMES
Based on the above data, answer the given subquestions
Q7Short answer1 Mark·Write the answer
Quiz 2 · 3 Aug 2025 (AN)Key ↓
List the horizon nodes in the best strategy. Enter the node labels as a comma separated list in ASCENDING order. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: X,Y,Z
Your answer:
Read the passage below, then answer Q8
GAMES
The figure shows a game tree with evaluation function values at the leaf nodes.
The leaf nodes are labeled from A to K.
Use these labels to enter a leaf node or a list of leaf nodes in short answers (textbox). Tie-breaker:
When several nodes carry the same best cost then select the deepest node,
if tie persists then select the leftmost of the deepest nodes to break the tie.
Based on the above data, answer the given subquestions.
Q8Short answer1 Mark·Write the answer
End Term · 31 Aug 2025 (AN)Key ↓
List the leaf nodes in the best strategy for MAX. Enter the node labels in alphabetical order. Enter a comma separated list of node labels in alphabetical order. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: X,Y,Z
Your answer:
Read the passage below, then answer Q9
GAMES
The figure shows a game tree with evaluation function values at the leaf nodes.
The leaf nodes are labeled from A to K.
Use these labels to enter a leaf node or a list of leaf nodes in short answers (textbox). Tie-breaker:
When several nodes carry the same best cost then select the deepest node, if tie persists then select the leftmost of the deepest nodes to break the tie.
Based on the above data, answer the given subquestions.
Q9Short answer1 Mark·Write the answer
End Term · 31 Aug 2025 (FN)Key ↓
List the leaf nodes in the best strategy for MAX. Enter the node labels in alphabetical order. Enter a comma separated list of node labels in alphabetical order. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: X,Y,Z
Your answer:

Type 4 · asked 3 times · Game trees: Minimax, Alpha-Beta, SSS*

List leaf nodes inspected or pruned by Alpha-Beta

Read the passage below, then answer Q10
GAMES
Based on the above data, answer the given subquestions
Q10Short answer1 Mark·Write the answer
Quiz 2 · 3 Aug 2025 (AN)Key ↓
List the horizon nodes pruned by Alpha-Beta algorithm. Enter the node labels as a comma separated list in ASCENDING order. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: X,Y,Z
Your answer:
Read the passage below, then answer Q11
GAMES
The figure shows a game tree with evaluation function values at the leaf nodes.
The leaf nodes are labeled from A to K.
Use these labels to enter a leaf node or a list of leaf nodes in short answers (textbox). Tie-breaker:
When several nodes carry the same best cost then select the deepest node,
if tie persists then select the leftmost of the deepest nodes to break the tie.
Based on the above data, answer the given subquestions.
Q11Short answer1 Mark·Write the answer
End Term · 31 Aug 2025 (AN)Key ↓
List the leaf nodes inspected by Alpha-Beta algorithm. Enter a comma separated list of node labels in alphabetical order. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: X,Y,Z
Your answer:
Read the passage below, then answer Q12
GAMES
The figure shows a game tree with evaluation function values at the leaf nodes.
The leaf nodes are labeled from A to K.
Use these labels to enter a leaf node or a list of leaf nodes in short answers (textbox). Tie-breaker:
When several nodes carry the same best cost then select the deepest node, if tie persists then select the leftmost of the deepest nodes to break the tie.
Based on the above data, answer the given subquestions.
Q12Short answer1 Mark·Write the answer
End Term · 31 Aug 2025 (FN)Key ↓
List the leaf nodes inspected by Alpha-Beta algorithm. Enter a comma separated list of node labels in alphabetical order. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: X,Y,Z
Your answer:

Type 5 · asked 3 times · Game trees: Minimax, Alpha-Beta, SSS*

List leaf nodes SOLVED by SSS*

Read the passage below, then answer Q13
GAMES
Based on the above data, answer the given subquestions
Q13Short answer1 Mark·Write the answer
Quiz 2 · 3 Aug 2025 (AN)Key ↓
Your answer:
Read the passage below, then answer Q14
GAMES
The figure shows a game tree with evaluation function values at the leaf nodes.
The leaf nodes are labeled from A to K.
Use these labels to enter a leaf node or a list of leaf nodes in short answers (textbox). Tie-breaker:
When several nodes carry the same best cost then select the deepest node,
if tie persists then select the leftmost of the deepest nodes to break the tie.
Based on the above data, answer the given subquestions.
Q14Short answer1 Mark·Write the answer
End Term · 31 Aug 2025 (AN)Key ↓
Your answer:
Read the passage below, then answer Q15
GAMES
The figure shows a game tree with evaluation function values at the leaf nodes.
The leaf nodes are labeled from A to K.
Use these labels to enter a leaf node or a list of leaf nodes in short answers (textbox). Tie-breaker:
When several nodes carry the same best cost then select the deepest node, if tie persists then select the leftmost of the deepest nodes to break the tie.
Based on the above data, answer the given subquestions.
Q15Short answer1 Mark·Write the answer
End Term · 31 Aug 2025 (FN)Key ↓
List the leaf nodes SOLVED by SSS*. Enter a comma separated list of node labels in alphabetical order. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: X,Y,Z
Your answer:

Type 6 · asked 3 times · Automated planning

Blocks World: select applicable actions in the start state

Read the passage below, then answer Q16
AUTOMATED PLANNING
The domain description of a Blocks World with a single one-armed robot is given below. Note: this is the same domain description used in the weekly assignments.
Tie-breaker: When actions are chosen non-deterministically, choose actions that lead to a plan. Throw away the actions that lead to dead-ends or cycles.
Tie-breaker: Treat the goal description, preconditions and effects as lists that are accessed from left to right. When the elements in a list are pushed one by one to a stack, the last element in the list will be at the top of the stack. It has the effect of reversing the list.
A planning problem is given below, find a plan using the operators and predicates defined in the blocks-world domain.
Based on the above data, answer the given subquestions
Q16MSQ1 Mark·Choose all correct options
Quiz 2 · 3 Aug 2025 (AN)Key ↓
Which of the following are applicable actions for the given planning problem?
1. APickup(D)
2. BPickup(G)
3. CPickup(M)
4. DUnstack(C,M)
5. EUnstack(E,D)
Read the passage below, then answer Q17
AUTOMATED PLANNING
The domain description of a Blocks World with a single one-armed robot is given below.
Consider the following planning problem.
Based on the above data, answer the given subquestions.
Q17MSQ1 Mark·Choose all correct options
End Term · 31 Aug 2025 (AN)Key ↓
Which of the following are applicable actions in the start state?
1. APutdown(D)
2. BUnstack(D,A)
3. CUnstack(E,B)
4. DPickup(C)
5. EPickup(A)
6. FStack(A,B)
7. GStack(B,C)
Read the passage below, then answer Q18
AUTOMATED PLANNING
The domain description of a Blocks World with a single one-armed robot is given below.
Based on the above data, answer the given subquestions.
Q18MSQ1 Mark·Choose all correct options
End Term · 31 Aug 2025 (FN)Key ↓
Which of the following are applicable actions in the start state?
1. APutdown(D)
2. BUnstack(D, B)
3. CUnstack(C, A)
4. DPickup(E)
5. EPickup(A)
6. FStack(B, A)
7. GStack(A, C)

Type 7 · asked 3 times · Automated planning

Blocks World: select relevant actions for the goal

Read the passage below, then answer Q19
AUTOMATED PLANNING
The domain description of a Blocks World with a single one-armed robot is given below. Note: this is the same domain description used in the weekly assignments.
Tie-breaker: When actions are chosen non-deterministically, choose actions that lead to a plan. Throw away the actions that lead to dead-ends or cycles.
Tie-breaker: Treat the goal description, preconditions and effects as lists that are accessed from left to right. When the elements in a list are pushed one by one to a stack, the last element in the list will be at the top of the stack. It has the effect of reversing the list.
A planning problem is given below, find a plan using the operators and predicates defined in the blocks-world domain.
Based on the above data, answer the given subquestions
Q19MSQ1 Mark·Choose all correct options
Quiz 2 · 3 Aug 2025 (AN)Key ↓
Which of the following are relevant actions for the given planning problem?
1. APickup(G)
2. BStack(E,M)
3. CStack(G,E)
4. DUnstack(C,M)
5. EUnstack(E,D)
Read the passage below, then answer Q20
AUTOMATED PLANNING
The domain description of a Blocks World with a single one-armed robot is given below.
Consider the following planning problem.
Based on the above data, answer the given subquestions.
Q20MSQ1 Mark·Choose all correct options
End Term · 31 Aug 2025 (AN)Key ↓
Which of the following are relevant actions in the goal state?
1. APutdown(D)
2. BUnstack(D,A)
3. CUnstack(E,B)
4. DPickup(C)
5. EPickup(A)
6. FStack(A,B)
7. GStack(B,C)
Read the passage below, then answer Q21
AUTOMATED PLANNING
The domain description of a Blocks World with a single one-armed robot is given below.
Based on the above data, answer the given subquestions.
Q21MSQ1 Mark·Choose all correct options
End Term · 31 Aug 2025 (FN)Key ↓
Which of the following are relevant actions in the goal state?
1. APutdown(D)
2. BUnstack(D, B)
3. CUnstack(C, A)
4. DPickup(E)
5. EPickup(A)
6. FStack(B, A)
7. GStack(A , C)

Type 8 · asked 2 times · Branch & Bound and A* search

Find the path returned by A* on a grid map with Manhattan heuristic

Read the passage below, then answer Q22
SEARCH
The figure shows a map on a uniform grid where each tile is 1x1 in size.
The start node is S and the goal node is G.
The MoveGen function returns nodes in alphabetical order.
Use Manhattan Distance as the heuristic function.
Tie-breaker: If several nodes have the same cost, use node labels to break the tie.
Based on the above data, answer the given subquestions.
Q22Short answer1 Mark·Write the answer
End Term · 31 Aug 2025 (AN)Key ↓
What is the path found by A* search algorithm? Enter the path as a comma separated list of node labels. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: S,X,Y,Z
Your answer:
Read the passage below, then answer Q23
SEARCH
Based on the above data, answer the given subquestions.
Q23Short answer1 Mark·Write the answer
End Term · 31 Aug 2025 (FN)Key ↓
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: S,X,Y,Z
Your answer:

Type 9 · asked 2 times · Branch & Bound and A* search

Find the path returned by Branch & Bound on a grid map

Read the passage below, then answer Q24
SEARCH
The figure shows a map on a uniform grid where each tile is 1x1 in size.
The start node is S and the goal node is G.
The MoveGen function returns nodes in alphabetical order.
Use Manhattan Distance as the heuristic function.
Tie-breaker: If several nodes have the same cost, use node labels to break the tie.
Based on the above data, answer the given subquestions.
Q24Short answer1 Mark·Write the answer
End Term · 31 Aug 2025 (AN)Key ↓
What is the path found by Branch-and-Bound search algorithm? Enter the path as a comma separated list of node labels. Use the Branch-and-Bound variation that avoids cyclic expansions like S,B,S,B,S,B,... NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: S,X,Y,Z
Your answer:
Read the passage below, then answer Q25
SEARCH
Based on the above data, answer the given subquestions.
Q25Short answer1 Mark·Write the answer
End Term · 31 Aug 2025 (FN)Key ↓
What is the path found by Branch-and-Bound search algorithm? Enter the path as a comma separated list of node labels. Use the Branch-and-Bound variation that avoids cyclic expansions like S,E,S,E,S,E,... NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: S,X,Y,Z
Your answer:

Type 10 · asked 2 times · Branch & Bound and A* search

Which algorithms find the shortest path on the given map

Read the passage below, then answer Q26
SEARCH
The figure shows a map on a uniform grid where each tile is 1x1 in size.
The start node is S and the goal node is G.
The MoveGen function returns nodes in alphabetical order.
Use Manhattan Distance as the heuristic function.
Tie-breaker: If several nodes have the same cost, use node labels to break the tie.
Based on the above data, answer the given subquestions.
Q26MCQ1 Mark·Choose one option
End Term · 31 Aug 2025 (AN)Key ↓
For the given map, which algorithm finds the shortest path from S to G?
1. A
2. B
3. C
4. D
Read the passage below, then answer Q27
SEARCH
Based on the above data, answer the given subquestions.
Q27MCQ1 Mark·Choose one option
End Term · 31 Aug 2025 (FN)Key ↓
For the given map, which algorithm finds the shortest path from S to G?
1. A
2. B
3. C
4. D

Type 11 · asked 2 times · TSP Branch & Bound

TSP BnB tree: list the 2nd-5th nodes refined

Read the passage below, then answer Q28
TSP BnB
TSP BnB algorithm is solving a TSP instance where the cities are A, B, C, .... and so on. The BnB search tree (at the point when the algorithm discovers the optimal tour) is provided below. Each node in the search tree displays an edge (either XY or ¬XY), a cost value, and a unique reference number (a1, b1, ..., c1, ..., d1, ..., e1, e2). Use the reference numbers to break ties. When required, use reference numbers in short answers.
What information can you glean from the search tree? Answer the sub-questions based on the information gleaned from the search tree.
Q28Short answer1 Mark·Write the answer
End Term · 31 Aug 2025 (AN)Key ↓
Let S0 (ref. no. a1) be the first node to be refined, identify the next 4 nodes (2nd to 5th node) that are refined by the TSP BnB algorithm. Enter the nodes (node reference numbers) in the order they are refined. Enter a comma separated list of node reference numbers. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: a9,b9,c9,d9
Your answer:
Read the passage below, then answer Q29
TSP Branch-and-Bound
The TSP Branch-and-Bound algorithm is solving a TSP instance where the cities are A, B, C, .... and so on. The Branch-and-Bound search tree at the time when the algorithm has discovered the optimal tour is shown below.
Each node in the search tree displays an edge (either XY or ~XY), a cost value, and a unique reference number (a1, b1, b2, ..., c1, ..., d1, ..., e1, e2). Use the reference numbers to break ties. When required, enter the reference numbers in short answers.
What information can you glean from the search tree? Answer the sub-questions based on the information gleaned from the search tree.
Q29Short answer1 Mark·Write the answer
End Term · 31 Aug 2025 (FN)Key ↓
Let S0 (ref. no. a1) be the first node to be refined, identify the next 4 nodes (2nd to 5th node) that are refined by the TSP Branch-and-Bound algorithm. Enter the nodes (node reference numbers) in the order they are refined. Enter a comma separated list of node reference numbers. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: a9,b9,c9,d9
Your answer:

Type 12 · asked 2 times · TSP Branch & Bound

TSP BnB tree: identify the node with the optimal tour

Read the passage below, then answer Q30
TSP BnB
TSP BnB algorithm is solving a TSP instance where the cities are A, B, C, .... and so on. The BnB search tree (at the point when the algorithm discovers the optimal tour) is provided below. Each node in the search tree displays an edge (either XY or ¬XY), a cost value, and a unique reference number (a1, b1, ..., c1, ..., d1, ..., e1, e2). Use the reference numbers to break ties. When required, use reference numbers in short answers.
What information can you glean from the search tree? Answer the sub-questions based on the information gleaned from the search tree.
Q30Short answer1 Mark·Write the answer
End Term · 31 Aug 2025 (AN)Key ↓
Which node represents the optimal tour? Enter the node reference number in the text box, or enter NIL if it is not possible to determine the optimal tour. Enter a node reference number. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: a9
Your answer:
Read the passage below, then answer Q31
TSP Branch-and-Bound
The TSP Branch-and-Bound algorithm is solving a TSP instance where the cities are A, B, C, .... and so on. The Branch-and-Bound search tree at the time when the algorithm has discovered the optimal tour is shown below.
Each node in the search tree displays an edge (either XY or ~XY), a cost value, and a unique reference number (a1, b1, b2, ..., c1, ..., d1, ..., e1, e2). Use the reference numbers to break ties. When required, enter the reference numbers in short answers.
What information can you glean from the search tree? Answer the sub-questions based on the information gleaned from the search tree.
Q31Short answer1 Mark·Write the answer
End Term · 31 Aug 2025 (FN)Key ↓
Which node represents the optimal tour? Enter the node reference number in the text box, or enter NIL if it is not possible to determine the optimal tour. Enter a node reference number. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: a9
Your answer:

Type 13 · asked 2 times · TSP Branch & Bound

TSP BnB tree: cost of the optimal tour

Read the passage below, then answer Q32
TSP BnB
TSP BnB algorithm is solving a TSP instance where the cities are A, B, C, .... and so on. The BnB search tree (at the point when the algorithm discovers the optimal tour) is provided below. Each node in the search tree displays an edge (either XY or ¬XY), a cost value, and a unique reference number (a1, b1, ..., c1, ..., d1, ..., e1, e2). Use the reference numbers to break ties. When required, use reference numbers in short answers.
What information can you glean from the search tree? Answer the sub-questions based on the information gleaned from the search tree.
Q32Short answer1 Mark·Write the answer
End Term · 31 Aug 2025 (AN)Key ↓
What is the cost of the optimal tour? Enter the cost of the optimal tour in the text box, or enter NIL if it is not possible to determine the optimal tour. Enter an integer. NO SPACES, TABS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: 42
Your answer:
Read the passage below, then answer Q33
TSP Branch-and-Bound
The TSP Branch-and-Bound algorithm is solving a TSP instance where the cities are A, B, C, .... and so on. The Branch-and-Bound search tree at the time when the algorithm has discovered the optimal tour is shown below.
Each node in the search tree displays an edge (either XY or ~XY), a cost value, and a unique reference number (a1, b1, b2, ..., c1, ..., d1, ..., e1, e2). Use the reference numbers to break ties. When required, enter the reference numbers in short answers.
What information can you glean from the search tree? Answer the sub-questions based on the information gleaned from the search tree.
Q33Short answer1 Mark·Write the answer
End Term · 31 Aug 2025 (FN)Key ↓
What is the cost of the optimal tour? Enter the cost of the optimal tour in the text box, or enter NIL if it is not possible to determine the optimal tour. Enter an integer. NO SPACES, TABS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: 42
Your answer:

Type 14 · asked 2 times · TSP Branch & Bound

TSP BnB tree: number of cities in the instance

Read the passage below, then answer Q34
TSP BnB
TSP BnB algorithm is solving a TSP instance where the cities are A, B, C, .... and so on. The BnB search tree (at the point when the algorithm discovers the optimal tour) is provided below. Each node in the search tree displays an edge (either XY or ¬XY), a cost value, and a unique reference number (a1, b1, ..., c1, ..., d1, ..., e1, e2). Use the reference numbers to break ties. When required, use reference numbers in short answers.
What information can you glean from the search tree? Answer the sub-questions based on the information gleaned from the search tree.
Q34Short answer1 Mark·Write the answer
End Term · 31 Aug 2025 (AN)Key ↓
Determine the number of cities in the TSP instance. Enter the number of cities in the text box, or enter NIL if it is not possible to determine the number of cities. Enter an integer. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: 42
Your answer:
Read the passage below, then answer Q35
TSP Branch-and-Bound
The TSP Branch-and-Bound algorithm is solving a TSP instance where the cities are A, B, C, .... and so on. The Branch-and-Bound search tree at the time when the algorithm has discovered the optimal tour is shown below.
Each node in the search tree displays an edge (either XY or ~XY), a cost value, and a unique reference number (a1, b1, b2, ..., c1, ..., d1, ..., e1, e2). Use the reference numbers to break ties. When required, enter the reference numbers in short answers.
What information can you glean from the search tree? Answer the sub-questions based on the information gleaned from the search tree.
Q35Short answer1 Mark·Write the answer
End Term · 31 Aug 2025 (FN)Key ↓
Determine the number of cities in the TSP instance. Enter the number of cities in the text box, or enter NIL if it is not possible to determine the number of cities. Enter an integer. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: 42
Your answer:

Type 15 · asked 2 times · TSP Branch & Bound

TSP BnB tree: path representation of the optimal tour

Read the passage below, then answer Q36
TSP BnB
TSP BnB algorithm is solving a TSP instance where the cities are A, B, C, .... and so on. The BnB search tree (at the point when the algorithm discovers the optimal tour) is provided below. Each node in the search tree displays an edge (either XY or ¬XY), a cost value, and a unique reference number (a1, b1, ..., c1, ..., d1, ..., e1, e2). Use the reference numbers to break ties. When required, use reference numbers in short answers.
What information can you glean from the search tree? Answer the sub-questions based on the information gleaned from the search tree.
Q36Short answer1 Mark·Write the answer
End Term · 31 Aug 2025 (AN)Key ↓
Start from city A, what is the path representation of the optimal tour? Enter the path representation in the text box, or enter NIL if it is not possible to determine the optimal tour. Enter a comma separated list of cities (city labels). NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: A,B,C
Your answer:
Read the passage below, then answer Q37
TSP Branch-and-Bound
The TSP Branch-and-Bound algorithm is solving a TSP instance where the cities are A, B, C, .... and so on. The Branch-and-Bound search tree at the time when the algorithm has discovered the optimal tour is shown below.
Each node in the search tree displays an edge (either XY or ~XY), a cost value, and a unique reference number (a1, b1, b2, ..., c1, ..., d1, ..., e1, e2). Use the reference numbers to break ties. When required, enter the reference numbers in short answers.
What information can you glean from the search tree? Answer the sub-questions based on the information gleaned from the search tree.
Q37Short answer1 Mark·Write the answer
End Term · 31 Aug 2025 (FN)Key ↓
Start from city A, what is the path representation of the optimal tour? Enter the path representation in the text box, or enter NIL if it is not possible to determine the optimal tour. Enter a comma separated list of cities (city labels). NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: A,B,C
Your answer:

Type 16 · asked 2 times · Game trees: Minimax, Alpha-Beta, SSS*

Identify a valid strategy for MAX in a game tree

Read the passage below, then answer Q38
GAMES
The figure shows a game tree with evaluation function values at the leaf nodes.
The leaf nodes are labeled from A to K.
Use these labels to enter a leaf node or a list of leaf nodes in short answers (textbox). Tie-breaker:
When several nodes carry the same best cost then select the deepest node,
if tie persists then select the leftmost of the deepest nodes to break the tie.
Based on the above data, answer the given subquestions.
Q38MSQ1 Mark·Choose all correct options
End Term · 31 Aug 2025 (AN)Key ↓
Which of the following is a strategy for the MAX player?
1. AI,K
2. BE,F,G
3. CE,F
4. DI,J,K
Read the passage below, then answer Q39
GAMES
The figure shows a game tree with evaluation function values at the leaf nodes.
The leaf nodes are labeled from A to K.
Use these labels to enter a leaf node or a list of leaf nodes in short answers (textbox). Tie-breaker:
When several nodes carry the same best cost then select the deepest node, if tie persists then select the leftmost of the deepest nodes to break the tie.
Based on the above data, answer the given subquestions.
Q39MSQ1 Mark·Choose all correct options
End Term · 31 Aug 2025 (FN)Key ↓
Which of the following is a strategy for the MAX player?
1. AD,E,F,G
2. BH,I,J,K
3. CD,E,F
4. DH,I

Type 17 · asked 2 times · Problem decomposition & AO*

AO*: list nodes expanded in order

Read the passage below, then answer Q40
PROBLEM DECOMPOSITION
The figure shows an AND-OR graph that depicts how a problem S can be decomposed into one or more smaller problems. Nodes are uniquely identified by labels (S, A, B, …). The number in each node is the heuristic estimate of the cost of solving that node.
Nodes shown in double lines are primitive nodes and their values are actual costs. Observe that a primitive node is added to the graph by its parent when the parent is expanded, and the primitive node is labeled as SOLVED and it will not be expanded subsequently.
The cost of each edge is 2 units.
Tie-breaker 1: If several nodes have the same cost then break the tie using node labels. Tie-breaker 2: For AND nodes, expand the unsolved branch with the highest cost.
Use AO* algorithm to solve S, then answer the subquestions.
Q40Short answer1 Mark·Write the answer
End Term · 31 Aug 2025 (AN)Key ↓
Your answer:
Read the passage below, then answer Q41
PROBLEM DECOMPOSITION
The figure shows an AND-OR graph that depicts how a problem S can be decomposed into one or more smaller problems. Nodes are uniquely identified by labels (S, A, B, …). The number in each node is the heuristic estimate of the cost of solving that node.
Nodes shown in double lines are primitive nodes and their values are actual costs. Observe that a primitive node is added to the graph by its parent when the parent is expanded, and the primitive node is labeled as SOLVED and it will not be expanded subsequently.
The cost of each edge is 10 units.
Tie-breaker 1: If several nodes have the same cost then break the tie using node labels. Tie-breaker 2: For AND nodes, expand the unsolved branch with the highest cost
Q41Short answer1 Mark·Write the answer
End Term · 31 Aug 2025 (FN)Key ↓
Enter a comma separated list of node labels. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: X,Y,Z
Your answer:

Type 18 · asked 2 times · Problem decomposition & AO*

AO*: value of start node S after each expansion

Read the passage below, then answer Q42
PROBLEM DECOMPOSITION
The figure shows an AND-OR graph that depicts how a problem S can be decomposed into one or more smaller problems. Nodes are uniquely identified by labels (S, A, B, …). The number in each node is the heuristic estimate of the cost of solving that node.
Nodes shown in double lines are primitive nodes and their values are actual costs. Observe that a primitive node is added to the graph by its parent when the parent is expanded, and the primitive node is labeled as SOLVED and it will not be expanded subsequently.
The cost of each edge is 2 units.
Tie-breaker 1: If several nodes have the same cost then break the tie using node labels. Tie-breaker 2: For AND nodes, expand the unsolved branch with the highest cost.
Use AO* algorithm to solve S, then answer the subquestions.
Q42Short answer1 Mark·Write the answer
End Term · 31 Aug 2025 (AN)Key ↓
Determine the value of the start node S after each node is expanded. Enter the value of S after each node is expanded. Enter a comma separated list of numbers. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: 12,42,17
Your answer:
Read the passage below, then answer Q43
PROBLEM DECOMPOSITION
The figure shows an AND-OR graph that depicts how a problem S can be decomposed into one or more smaller problems. Nodes are uniquely identified by labels (S, A, B, …). The number in each node is the heuristic estimate of the cost of solving that node.
Nodes shown in double lines are primitive nodes and their values are actual costs. Observe that a primitive node is added to the graph by its parent when the parent is expanded, and the primitive node is labeled as SOLVED and it will not be expanded subsequently.
The cost of each edge is 10 units.
Tie-breaker 1: If several nodes have the same cost then break the tie using node labels. Tie-breaker 2: For AND nodes, expand the unsolved branch with the highest cost
Q43Short answer1 Mark·Write the answer
End Term · 31 Aug 2025 (FN)Key ↓
Determine the value of the start node S after each node is expanded. Enter the value of S after each node is expanded. Enter a comma separated list of numbers. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: 12,42,17
Your answer:

Type 19 · asked 2 times · Problem decomposition & AO*

AO*: final value of the start node S

Read the passage below, then answer Q44
PROBLEM DECOMPOSITION
The figure shows an AND-OR graph that depicts how a problem S can be decomposed into one or more smaller problems. Nodes are uniquely identified by labels (S, A, B, …). The number in each node is the heuristic estimate of the cost of solving that node.
Nodes shown in double lines are primitive nodes and their values are actual costs. Observe that a primitive node is added to the graph by its parent when the parent is expanded, and the primitive node is labeled as SOLVED and it will not be expanded subsequently.
The cost of each edge is 2 units.
Tie-breaker 1: If several nodes have the same cost then break the tie using node labels. Tie-breaker 2: For AND nodes, expand the unsolved branch with the highest cost.
Use AO* algorithm to solve S, then answer the subquestions.
Q44NAT1 Mark·Write the number
End Term · 31 Aug 2025 (AN)Key ↓
Your answer:
Read the passage below, then answer Q45
PROBLEM DECOMPOSITION
The figure shows an AND-OR graph that depicts how a problem S can be decomposed into one or more smaller problems. Nodes are uniquely identified by labels (S, A, B, …). The number in each node is the heuristic estimate of the cost of solving that node.
Nodes shown in double lines are primitive nodes and their values are actual costs. Observe that a primitive node is added to the graph by its parent when the parent is expanded, and the primitive node is labeled as SOLVED and it will not be expanded subsequently.
The cost of each edge is 10 units.
Tie-breaker 1: If several nodes have the same cost then break the tie using node labels. Tie-breaker 2: For AND nodes, expand the unsolved branch with the highest cost
Q45NAT1 Mark·Write the number
End Term · 31 Aug 2025 (FN)Key ↓
What is the final value of the start node S computed by AO*? Enter a number. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: 17
Your answer:

Type 20 · asked 2 times · Rule-based expert systems & Rete

Rete net: which rule-data tuples are in the conflict set

Read the passage below, then answer Q46
RULE BASED EXPERT SYSTEMS
A Rete Net for a rule based system to identify engines, turbines and motors is shown in the figure. Here, BoM refers to Bill-of-Materials, which is a list of parts and their quantities needed for assembling a machine.
The nodes in the network are uniquely identified by labels: A1,A2,... for Alpha nodes; B1,B2,... for beta nodes; R1,R2,... for rules.
The Working Memory contains the following WMEs uniquely identified by timestamps (sequence numbers). Assume that WMEs reside in the appropriate Alpha node, and Beta nodes simply point to elements in the ancestor Alpha nodes.
The sub-questions are based on the first Match-Resolve-Execute cycle. Determine the locations of the WMEs and compute the conflict set, then answer the given sub-questions.
Q46MSQ1 Mark·Choose all correct options
End Term · 31 Aug 2025 (AN)Key ↓
Which of the following rule-data tuples occur in the conflict set?
1. A(Liquid-Fuel-Rocket, 102, 107)
2. B(Solid-Fuel-Rocket, 107, 101)
3. C(Windmill, 105, 104)
4. D(Generator, 104)
5. E(Generator, 106)
6. F(Rocket, 107)
Read the passage below, then answer Q47
RULE BASED EXPERT SYSTEMS
A Rete Net for a rule based system to identify engines, turbines and motors is shown in the figure. BoM refers to Bill-of-Materials, which is a list of parts and their quantities needed for assembling a machine.
The nodes in the network are uniquely identified by labels: A1,A2,... for Alpha nodes; B1,B2,... for beta nodes; R1,R2,... for rules.
The Working Memory contains the following WMEs uniquely identified by timestamps (sequence numbers). Assume that WMEs reside in the appropriate Alpha node, and Beta nodes simply point to elements in the ancestor Alpha nodes.
The sub-questions are based on the first Match-Resolve-Execute cycle. Determine the locations of the WMEs and compute the conflict set, then answer the sub-questions.
Q47MSQ1 Mark·Choose all correct options
End Term · 31 Aug 2025 (FN)Key ↓
Which of the following rule-data tuples occur in the conflict set?
1. A(Diesel-Engine, 101, 107)
2. B(Petrol-Engine, 107, 102)
3. C(Engine, 107)
4. D(Single-Phase-Motor, 105, 104)
5. E(Motor, 104)
6. F(Motor, 106)

Type 21 · asked 2 times · Rule-based expert systems & Rete

Rete net: rule that fires first under Specificity

Read the passage below, then answer Q48
RULE BASED EXPERT SYSTEMS
A Rete Net for a rule based system to identify engines, turbines and motors is shown in the figure. Here, BoM refers to Bill-of-Materials, which is a list of parts and their quantities needed for assembling a machine.
The nodes in the network are uniquely identified by labels: A1,A2,... for Alpha nodes; B1,B2,... for beta nodes; R1,R2,... for rules.
The Working Memory contains the following WMEs uniquely identified by timestamps (sequence numbers). Assume that WMEs reside in the appropriate Alpha node, and Beta nodes simply point to elements in the ancestor Alpha nodes.
The sub-questions are based on the first Match-Resolve-Execute cycle. Determine the locations of the WMEs and compute the conflict set, then answer the given sub-questions.
Q48MCQ1 Mark·Choose one option
End Term · 31 Aug 2025 (AN)Key ↓
If the Inference Engine uses Specificity for conflict resolution then which rule-data tuple will fire in the first round?
1. A(Liquid-Fuel-Rocket, 102, 107)
2. B(Solid-Fuel-Rocket, 107, 101)
3. C(Windmill, 105, 104)
4. D(Generator, 104)
5. E(Generator, 106)
6. F(Rocket, 107)
Read the passage below, then answer Q49
RULE BASED EXPERT SYSTEMS
A Rete Net for a rule based system to identify engines, turbines and motors is shown in the figure. BoM refers to Bill-of-Materials, which is a list of parts and their quantities needed for assembling a machine.
The nodes in the network are uniquely identified by labels: A1,A2,... for Alpha nodes; B1,B2,... for beta nodes; R1,R2,... for rules.
The Working Memory contains the following WMEs uniquely identified by timestamps (sequence numbers). Assume that WMEs reside in the appropriate Alpha node, and Beta nodes simply point to elements in the ancestor Alpha nodes.
The sub-questions are based on the first Match-Resolve-Execute cycle. Determine the locations of the WMEs and compute the conflict set, then answer the sub-questions.
Q49MCQ1 Mark·Choose one option
End Term · 31 Aug 2025 (FN)Key ↓
If the Inference Engine uses Specificity for conflict resolution then which rule-data tuple will fire in the first round?
1. A(Diesel-Engine, 101, 107)
2. B(Petrol-Engine, 107, 102)
3. C(Engine, 107)
4. D(Single-Phase-Motor, 105, 104)
5. E(Motor, 104)
6. F(Motor, 106)

Type 22 · asked 2 times · Rule-based expert systems & Rete

Rete net: rule that fires first under Recency

Read the passage below, then answer Q50
RULE BASED EXPERT SYSTEMS
A Rete Net for a rule based system to identify engines, turbines and motors is shown in the figure. Here, BoM refers to Bill-of-Materials, which is a list of parts and their quantities needed for assembling a machine.
The nodes in the network are uniquely identified by labels: A1,A2,... for Alpha nodes; B1,B2,... for beta nodes; R1,R2,... for rules.
The Working Memory contains the following WMEs uniquely identified by timestamps (sequence numbers). Assume that WMEs reside in the appropriate Alpha node, and Beta nodes simply point to elements in the ancestor Alpha nodes.
The sub-questions are based on the first Match-Resolve-Execute cycle. Determine the locations of the WMEs and compute the conflict set, then answer the given sub-questions.
Q50MCQ1 Mark·Choose one option
End Term · 31 Aug 2025 (AN)Key ↓
If the Inference Engine uses Recency for conflict resolution which rule-data tuple will fire in the first round?
1. A(Liquid-Fuel-Rocket, 102, 107)
2. B(Solid-Fuel-Rocket, 107, 101)
3. C(Windmill, 105, 104)
4. D(Generator, 104)
5. E(Generator, 106)
6. F(Rocket, 107)
Read the passage below, then answer Q51
RULE BASED EXPERT SYSTEMS
A Rete Net for a rule based system to identify engines, turbines and motors is shown in the figure. BoM refers to Bill-of-Materials, which is a list of parts and their quantities needed for assembling a machine.
The nodes in the network are uniquely identified by labels: A1,A2,... for Alpha nodes; B1,B2,... for beta nodes; R1,R2,... for rules.
The Working Memory contains the following WMEs uniquely identified by timestamps (sequence numbers). Assume that WMEs reside in the appropriate Alpha node, and Beta nodes simply point to elements in the ancestor Alpha nodes.
The sub-questions are based on the first Match-Resolve-Execute cycle. Determine the locations of the WMEs and compute the conflict set, then answer the sub-questions.
Q51MCQ1 Mark·Choose one option
End Term · 31 Aug 2025 (FN)Key ↓
If the Inference Engine uses Recency for conflict resolution which rule-data tuple will fire in the first round?
1. A(Diesel-Engine, 101, 107)
2. B(Petrol-Engine, 107, 102)
3. C(Engine, 107)
4. D(Single-Phase-Motor, 105, 104)
5. E(Motor, 104)
6. F(Motor, 106)

Type 23 · asked 2 times · Automated planning

Planning graph: mutex action pairs in layer 1

Read the passage below, then answer Q52
AUTOMATED PLANNING
The domain description of a Blocks World with a single one-armed robot is given below.
Consider the following planning problem.
Based on the above data, answer the given subquestions.
Q52MSQ1 Mark·Choose all correct options
End Term · 31 Aug 2025 (AN)Key ↓
In the planning graph, which of the following are mutex action pairs in Layer 1?
1. AUnstack(D,A), Pickup(C)
2. BUnstack(D,A), Unstack(E,B)
3. CPickup(C), Stack(A,B)
4. DPickup(C), Stack(B,C)
Read the passage below, then answer Q53
AUTOMATED PLANNING
The domain description of a Blocks World with a single one-armed robot is given below.
Based on the above data, answer the given subquestions.
Q53MSQ1 Mark·Choose all correct options
End Term · 31 Aug 2025 (FN)Key ↓
In the planning graph, which of the following are mutex action pairs in Layer 1?
1. AUnstack(D, B), Pickup(E)
2. BUnstack(D, B), Unstack(C, A)
3. CPickup(E), Stack(B, A)
4. DPickup(E), Stack(A, C)

Type 24 · asked 2 times · Automated planning

Planning graph: mutex proposition pairs in layer 1

Read the passage below, then answer Q54
AUTOMATED PLANNING
The domain description of a Blocks World with a single one-armed robot is given below.
Consider the following planning problem.
Based on the above data, answer the given subquestions.
Q54MSQ1 Mark·Choose all correct options
End Term · 31 Aug 2025 (AN)Key ↓
In the planning graph, which of the following are mutex proposition pairs in Layer 1?
1. Aclear(A), holding(E)
2. Bclear(A), clear(B)
3. Cclear(C), on(D,A)
4. Dclear(C), holding(E)
Read the passage below, then answer Q55
AUTOMATED PLANNING
The domain description of a Blocks World with a single one-armed robot is given below.
Based on the above data, answer the given subquestions.
Q55MSQ1 Mark·Choose all correct options
End Term · 31 Aug 2025 (FN)Key ↓
In the planning graph, which of the following are mutex proposition pairs in Layer 1?
1. Aclear(B), holding(C)
2. Bclear(B), clear(A)
3. Cclear(E), on(D, B)
4. Dclear(E), holding(D)

Type 25 · asked 2 times · Constraint satisfaction

Is the 3-region map-colouring CSP arc consistent?

Read the passage below, then answer Q56
CONSTRAINT SATISFACTION
Q56MCQ1 Mark·Choose one option
End Term · 31 Aug 2025 (AN)Key ↓
Is the given CSP arc consistent?
1. AYes
2. BNo
3. CCannot be determined
Read the passage below, then answer Q57
CONSTRAINT SATISFACTION
Q57MCQ1 Mark·Choose one option
End Term · 31 Aug 2025 (FN)Key ↓
Is the given CSP arc consistent?
1. AYes
2. BNo
3. CCannot be determined

Type 26 · asked 2 times · Constraint satisfaction

Is the 3-region map-colouring CSP path consistent?

Read the passage below, then answer Q58
CONSTRAINT SATISFACTION
Q58MCQ1 Mark·Choose one option
End Term · 31 Aug 2025 (AN)Key ↓
Is the given CSP path consistent?
1. ANo
2. BYes
3. CCannot be determined
Read the passage below, then answer Q59
CONSTRAINT SATISFACTION
Q59MCQ1 Mark·Choose one option
End Term · 31 Aug 2025 (FN)Key ↓
Is the given CSP path consistent?
1. ANo
2. BYes
3. CCannot be determined

Type 27 · asked 2 times · Constraint satisfaction

Find a solution of the 3-region map-colouring CSP or NIL

Read the passage below, then answer Q60
CONSTRAINT SATISFACTION
Q60Short answer1 Mark·Write the answer
End Term · 31 Aug 2025 (AN)Key ↓
Does the given CSP have a solution? Enter the solution for regions A,B,C as a comma separated list of colours. Enter NIL if there is no solution. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: r,b,r
Your answer:
Read the passage below, then answer Q61
CONSTRAINT SATISFACTION
Q61Short answer1 Mark·Write the answer
End Term · 31 Aug 2025 (FN)Key ↓
Does the given CSP have a solution? Enter the solution for regions A,B,C as a comma separated list of colours. Enter NIL if there is no solution. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: r,b,r
Your answer:

Official Key

Master Answer Key & Explanations

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

Reveal Key

Q1S,C,F,G

Q2S,E,C,G

Q3S,H,E,D,B,G

Q4A

Q5A

Q6A

Q7D,E,F

Q8A,C,D

Q9A,C

Q10H,I

Q11A,B,E,I

Q12A,B,D,H

Q13E,F

Q14A,B,E,I / A,E,I,B / I,E,A,B

Q15A,B,D,H / A,D,H,B / D,H,A,B

Q16B, D, E

Q17B, C, D

Q18B, C, D

Q19B, C

Q20F, G

Q21F, G

Q22S,B,A,E,G

Q23S,F,B,A,G

Q24S,B,A,E,G

Q25S,F,B,A,G

Q26C

Q27C

Q28b1,c1,d2,b2

Q29b1,c2,b2,c3

Q30d5

Q31d3

Q32366

Q33434

Q345

Q355

Q36A,B,D,C,E / A,E,C,D,B

Q37A,B,D,E,C / A,C,E,D,B

Q38A, C

Q39C, D

Q40S,B,A / B,A

Q41S,C,B / C,B

Q4234,37,56 / 37,56

Q4345,50,80 / 50,80

Q4456

Q4580

Q46C, D, E, F

Q47C, D, E, F

Q48C

Q49D

Q50F

Q51C

Q52A, B

Q53A, B

Q54A, B

Q55A, B

Q56A

Q57A

Q58A

Q59A

Q60g,r,b / g,b,r

Q61g,r,b / g,b,r

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.