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 The figure shows a map on a grid where each tile is 1x1 in size. All locations are at grid points. The start node is S, and the goal node is G. MoveGen returns neighbours in alphabetical order. Use Manhattan distance as the heuristic function. Tie-breaker: Use alphabetical order to break ties.
Emulate A*, WA* (w=2) and Branch-and-Bound on the given map, then answer the sub-questions.
In the map, S is the first node to be refined, determine the next 3 nodes (from the 2nd to 4th node) refined by A*. Enter the nodes in the order they are refined. Enter a comma separated list of node labels. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: X,Y,Z Answers Case Sensitive : No
SEARCH The figure shows a map on a grid where each tile is 1x1 in size. All locations are at grid points. The start node is S, and the goal node is G. MoveGen returns neighbours in alphabetical order. Use Manhattan distance as the heuristic function. Tie-breaker: Use alphabetical order to break ties.
Emulate A*, WA* (w=2) and Branch-and-Bound on the given map, then answer the sub-questions.
What is the final path found by A* ? Enter the path as a comma separated list. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: S,X,Y,G 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) Quiz 2 paper sat on 12 Apr 2026, in the January 2026 term: 21 questions for 21 marks in 120 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 Quiz 2 12 Apr 2026 at a glance |
|---|---|
| Term | January 2026 term |
| Subject | AI: Search Methods for Problem Solving |
| Course code | BSCS3003 |
| Questions | 21 |
| Marks | 21 |
| Duration | 120 min |
| MSQ | 5 |
| Written | 7 |
| Numerical | 4 |
| MCQ | 5 |
| Official paper | Ai: Search Methods For Problem Solving 07 Apr 26 |
| Negative marking | No negative marking. |
| Updated |