Printed graph sheets (hard copy) will be provided for registered candidates only.
ASK FOR PRINTED GRAPH SHEETS
8 PAGES TWO-SIDE PRINT
Printed graph sheets were provided to me.
Printed graph sheets were not provided to me.
I did not use graph sheets.
SEARCH
The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at grid points and are connected by two way edges (roads), where each edge has a cost that is the same in both directions. Observe that the edge costs are not necessarily proportional to the coordinate based distance estimates.
The start node is S and the goal node is G, the MoveGen function returns neighbours in alphabetical order. Use Manhattan distance as the heuristic function.
Tie-breaker: when several nodes have the same best cost, use alphabetical order to break ties.
Emulate A*, WA* and Branch-and-Bound on the given map, then answer the subquestions.
In the map, S is the first node to be refined, determine the next 4 nodes from the 2nd to 5th 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: W,X,Y,Z
SEARCH
The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at grid points and are connected by two way edges (roads), where each edge has a cost that is the same in both directions. Observe that the edge costs are not necessarily proportional to the coordinate based distance estimates.
The start node is S and the goal node is G, the MoveGen function returns neighbours in alphabetical order. Use Manhattan distance as the heuristic function.
Tie-breaker: when several nodes have the same best cost, use alphabetical order to break ties.
Emulate A*, WA* and Branch-and-Bound on the given map, then answer the subquestions.
For the 4 nodes listed in the previous question, list the f-values of those nodes as a comma separated list. Use the same node order used in the previous question.
Enter a comma separated list of natural numbers.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: 2,7,1,8
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 3 Dec 2023, in the September 2023 term: 26 questions for 25 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 3 Dec 2023 at a glance |
|---|---|
| Term | September 2023 term |
| Subject | AI: Search Methods for Problem Solving |
| Course code | BSCS3003 |
| Questions | 26 |
| Marks | 25 |
| Duration | 120 min |
| MCQ | 6 |
| Written | 13 |
| Numerical | 5 |
| MSQ | 2 |
| Official paper | IIT M DEGREE AN2 EXAM QDB2 03 Dec 2023 |
| Negative marking | No negative marking. |
| Updated |
