Question 1
Printed graph sheets were provided on time.
Printed graph sheets were provided late.
Printed graph sheets were not provided.
I used the graph sheets.
I did not use graph sheets.
Printed graph sheets were provided on time.
Printed graph sheets were provided late.
Printed graph sheets were not provided.
I used the graph sheets.
I did not use graph sheets.
SEARCH Consider a water-jug puzzle with three jugs a, b and c of capacities 5L, 3L and 2L, respectively. A state, encoded as a digit string ABC, denotes volume of water in jugs a, b and c, respectively. For example, state 212 denotes that jugs a, b and c contain 2L, 1L and 2L of water, respectively.
MoveGen takes a state ABC and returns a set of neighbours that are one move away from ABC. For example, MoveGen(212) = { 032, 302, 410, 230 }. Based on the above data, answer the given subquestions.
Let 320 be the start state and 401 be the goal state, find the shortest path from start to goal. Enter the path starting with 320 as a comma separated list of states. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: 320,302,500 Answers Case Sensitive : No
SEARCH Consider a water-jug puzzle with three jugs a, b and c of capacities 5L, 3L and 2L, respectively. A state, encoded as a digit string ABC, denotes volume of water in jugs a, b and c, respectively. For example, state 212 denotes that jugs a, b and c contain 2L, 1L and 2L of water, respectively.
MoveGen takes a state ABC and returns a set of neighbours that are one move away from ABC. For example, MoveGen(212) = { 032, 302, 410, 230 }. Based on the above data, answer the given subquestions.
Let 320 be the start state and 401 be the goal state, find the sequence of moves that produce the shortest path from start to goal. Enter the sequence of moves as a comma separated list. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: aEb,aTc,bETa,cETb Answers Case Sensitive : No
Sign in with Google — it is free — to see every question with its answer and explanation, practise it in learning mode, or take it as a timed mock test.
The IIT Madras BS AI: Search Methods for Problem Solving (AI Search Methods) End Term paper sat on 10 May 2026, in the January 2026 term, set 1: 33 questions for 33 marks in 180 minutes. The first 3 questions are below. Sign in with Google — it is free — to see the whole paper with its answers and explanations, in learning mode or as a timed mock test.
| Feature | AI Search Methods End Term 10 May 2026 Set 1 at a glance |
|---|---|
| Term | January 2026 term |
| Subject | AI: Search Methods for Problem Solving |
| Course code | BSCS3003 |
| Questions | 33 |
| Marks | 33 |
| Duration | 180 min |
| MSQ | 14 |
| Written | 11 |
| MCQ | 7 |
| Numerical | 1 |
| Official paper | Ai: Search Methods For Problem Solving 06 May 26 |
| Negative marking | No negative marking. |
| Updated |