Quiz Space

AI Search Methods End Term: 3 September 2023, Set QPE1-S1 (May 2023 term)

Question 1

+1 markWritten answer

SEARCH
The figure shows a map on a uniform grid where each tile is 10x10 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 Depth 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 2

+1 markWritten answer

SEARCH
The figure shows a map on a uniform grid where each tile is 10x10 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

+1 markWritten answer

SEARCH
The figure shows a map on a uniform grid where each tile is 10x10 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

22 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 3 Sept 2023 Set QPE1-S1 paper

The IIT Madras BS AI: Search Methods for Problem Solving (AI Search Methods) End Term paper sat on 3 Sept 2023, in the May 2023 term (T2 2023), set QPE1-S1: 25 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.

FeatureAI Search Methods End Term 3 Sept 2023 Set QPE1-S1 at a glance
TermMay 2023 term (T2 2023)
SubjectAI: Search Methods for Problem Solving
Course codeBSCS3003
Questions25
Marks25
Duration180 min
Written14
MCQ4
Numerical2
MSQ5
Official paperIIT M DEGREE ET1 EXAM QPE1 S2 03 Sep
Negative markingNo negative marking.
Updated

Other sets that day

Same End Term, other subjects

More AI Search Methods