Quiz Space

AI Search Methods Quiz 2: 3 August 2025 (May 2025 term)

Question 1

+1 markOne correct option

SEARCH
Figure shows an infinite state space with finite branching, where S is the start node and G is the goal node, and G is at the center of a unit circle, and the remaining nodes are on the unit circle. (Note: circular grid is shown by dashed lines which are not part of the state space.)

Take the radial distance as the heuristic value:
h(G)=0; h(S)=1; and h(Ak)=1, for all k in {1, 2, . . .}.
MoveGen returns neighbours in alphabetical order (A1,A2,..., G,S).
Tie-breaker: use alphabetical order to break ties.
Note: sum(1, a, a^2, a^3, ..., a^(n-1)) is given by ((1 - a^n)/(1 - a)).
Based on the above data, answer the given subquestions

Does the Breadth First Search find the path to the goal?

  1. A

    Yes

  2. B

    No

  3. C

    Cannot be determined

Question 2

+1 markOne correct option

SEARCH
Figure shows an infinite state space with finite branching, where S is the start node and G is the goal node, and G is at the center of a unit circle, and the remaining nodes are on the unit circle. (Note: circular grid is shown by dashed lines which are not part of the state space.)

Take the radial distance as the heuristic value:
h(G)=0; h(S)=1; and h(Ak)=1, for all k in {1, 2, . . .}.
MoveGen returns neighbours in alphabetical order (A1,A2,..., G,S).
Tie-breaker: use alphabetical order to break ties.
Note: sum(1, a, a^2, a^3, ..., a^(n-1)) is given by ((1 - a^n)/(1 - a)).
Based on the above data, answer the given subquestions

Does the Best First Search find the path to the goal?

  1. A

    Yes

  2. B

    No

  3. C

    Cannot be determined

Question 3

+1 markOne correct option

SEARCH
Figure shows an infinite state space with finite branching, where S is the start node and G is the goal node, and G is at the center of a unit circle, and the remaining nodes are on the unit circle. (Note: circular grid is shown by dashed lines which are not part of the state space.)

Take the radial distance as the heuristic value:
h(G)=0; h(S)=1; and h(Ak)=1, for all k in {1, 2, . . .}.
MoveGen returns neighbours in alphabetical order (A1,A2,..., G,S).
Tie-breaker: use alphabetical order to break ties.
Note: sum(1, a, a^2, a^3, ..., a^(n-1)) is given by ((1 - a^n)/(1 - a)).
Based on the above data, answer the given subquestions

Does the Branch and Bound algorithm find the path to the goal?

  1. A

    Yes

  2. B

    No

  3. C

    Cannot be determined

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 Quiz 2 3 Aug 2025 paper

The IIT Madras BS AI: Search Methods for Problem Solving (AI Search Methods) Quiz 2 paper sat on 3 Aug 2025, in the May 2025 term: 25 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.

FeatureAI Search Methods Quiz 2 3 Aug 2025 at a glance
TermMay 2025 term
SubjectAI: Search Methods for Problem Solving
Course codeBSCS3003
Questions25
Marks25
Duration120 min
MCQ12
Numerical5
Written5
MSQ3
Official paperIIT M DEGREE AN EXAM QDB2 03 Aug 2025
Negative markingNo negative marking.
Updated

Same Quiz 2, other subjects

More AI Search Methods