Question 1
ASK FOR PRINTED GRAPH SHEETS
10 PAGES
DOUBLE-SIDED
Printed graph sheets were provided to me.
Printed graph sheets were not provided to me.
I did not use graph sheets.
Question 2
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.
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
Question 3
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.
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
23 more questions in this paper
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.
More on the AI Search Methods End Term 1 Sept 2024 Set QDB1 paper
The IIT Madras BS AI: Search Methods for Problem Solving (AI Search Methods) End Term paper sat on 1 Sept 2024, in the May 2024 term, set QDB1: 26 questions for 25 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 1 Sept 2024 Set QDB1 at a glance |
|---|---|
| Term | May 2024 term |
| Subject | AI: Search Methods for Problem Solving |
| Course code | BSCS3003 |
| Questions | 26 |
| Marks | 25 |
| Duration | 180 min |
| MCQ | 4 |
| Written | 13 |
| MSQ | 7 |
| Numerical | 2 |
| Official paper | IIT M DEGREE FN EXAM QDB1 01 Sep 2024 |
| Negative marking | No negative marking. |
| Updated |