## NPTEL Fundamentals of Artificial intelligence Week 2 Assignment Answers 2024

1. Greedy search strategy chooses the ____________ for expansion first.

A. shallowest node

B. deepest node

C. node closest to the goal node

D. node with minimum heuristic cost

Answer :- c

2. A* generates an optimal solution under which of the following conditions?

Condition 1: If h(n) is an admissible heuristic and the search space is a tree.

Condition 2: If h(n) is a consistent heuristic and the search space is a graph.

A. A* never generate an optimal solution.

B. Condition 1 only

C. Condition 2 only

D. Both Condition 1 and Condition 2

Answer :- d

3. A solution to a CSP is a complete assignment that satisfies all the constraints. Which of the two are true for a solution to a CSP?

I. An assignment that does not violate any constraints is called consistent or legal.

II. A complete assignment is one in which every variable is mentioned.

A. Neither I nor II

B. Both I and II

C. I only

D. II only

Answer :-Click Here

4. **____________** is a backtracking algorithm for CSP that is aware of the underlying constraint graph; determines where to jump back to, based on the actual conflict that it has recorded.

A. Plain Backtracking

B. Chronological Backtracking

C. Conflict-directed Backjumping

D. Arc Consistency

Answer :-Click Here

5. A consistent heuristic is admissible; consistent heuristics places **__________** constraints on the heuristic.

A. softer

B. stricter

C. weaker

D. relaxed

Answer :-

6. Compute the Hamming Distance of the start state for the given instance h1(start).

A. 5

B. 7

C. 6

D. 4

Answer :-

7. Compute the Manhattan Distance of the start state for the given instance h2(start).

A. 5

B. 7

C. 6

D. 4

Answer :-Click Here

8. Find the number of moves required to reach the goal from the start using the Manhattan Distance heuristics.

A. 5

B. 7

C. 6

D. 4

Answer :-

9. How many states were required to be expanded for reaching the goal?

A. 5

B. 7

C. 6

D. 4

Answer :-

10. Which among the two i.e., Hamming Distance h1 and Manhattan Distance h2 is a more efficient heuristic?

A. Hamming Distance h1

B. Manhattan Distance h2

C. Both are equally good

D. Both are equally worse

Answer :-Click Here