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

AI Search · State spaces

3 questions · 3 marks · 1 paper

Answer key

Indian Institute of Technology Madras

BS Degree Programme · Examination & Study Paper

AI: Search Methods for Problem Solving

State spaces

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.
Scientific calculator allowed for all calculations.
Official answer key is sealed at the end of this sheet.

Read the passage below, then answer Q1–Q3
STATE SPACE
Consider 3-puzzle (a smaller version of 8-puzzle) where a tile (carrying a numeric label) can slide one position either horizontally or vertically into the adjacent empty spot, effectively swapping the tile and the adjacent empty spot. A tile cannot slide diagonally.
Begin from the start state and build the state space graph by generating valid moves, call it Graph- 1230, use this graph to answer the sub-questions.
Q1MSQ1 Mark·Choose all correct options
Key ↓
1. AState A
2. BState B
3. CState C
4. DState D
Q2MSQ1 Mark·Choose all correct options
Key ↓
Select the statements that are true about Graph-1230.
1. AEvery move is reversible.
2. BEvery state has a path to every other state.
3. CSome states have more than two neighbours.
4. DEvery state has exactly two neighbours.
5. EEvery state has exactly one neighbour.
Q3MCQ1 Mark·Choose one option
Key ↓
The number of unique states in Graph-1230 is __________ .
1. Aless than 8
2. Bequal to 8
3. Cmore than 8

Official Key

Master Answer Key & Explanations

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

Reveal Key

Q1B, C

Q2A, B, D

Q3C

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.