Fundamentals of Artificial Intelligence Week 2 Answers
Are you looking for Fundamentals of Artificial Intelligence Week 2 Answers? All weeks solutions of this Swayam course are available here.
Table of Contents
Fundamentals of Artificial Intelligence Week 2 Answers (July-Dec 2025)
Course link: Click here to visit course on Nptel Website
Question 1. A generates an optimal solution under which of the following conditions?*
I. If h(n) is an admissible heuristic and the search space is a tree.
II. If h(n) is a consistent heuristic and the search space is a graph.
a) A* never generate an optimal solution.
b) I only
c) Both I and II
d) II only
Question 2. Fringe are the nodes waiting in a sequence to be explored. Fringe for the Depth-First Search is a _________ data structure.
a) Unordered
b) FIFO
c) LIFO
d) Queue
Question 3. Solving a constraint satisfaction problem on a finite domain is an/a ___________ problem with respect to the domain size.
a) P complete
b) NP complete
c) NP hard
d) Domain dependent
Question 4. 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
These are Fundamentals of Artificial Intelligence Week 2 Answers
Question 5. Conflict-directed Backjumping is better than Simple Backjumping because:
I. When a partial solution cannot be executed, the algorithm backtracks to the latest choice point.
II. When a contradiction occurs, remember the minimum set of variables from the conflict set that was responsible for the problem.
a) Neither I nor II
b) Both I and II
c) I only
d) II only
Question 6. The A search algorithm is based on ___________.*
a) Breadth-First-Search
b) Depth-First –Search
c) Best-First-Search
d) Hill climbing
Question 7. Starting with node A; node B and node F can be reached from node A. Which node does algorithm A considers next? Why?*
[Here f(n) is the heuristic function at node n.]
a) Node F; f(F) > f(B)
b) Node B; f(B) > f(F)
c) Node B; f(B) < f(G)
d) Node F; f(F) < f(B)
These are Fundamentals of Artificial Intelligence Week 2 Answers
Question 8. Which node among the successors of node I along the most-effective path (i.e., nodes that can be reached from node I) have the least value for the evaluation function f(n)?
a) Node E
b) Node H
c) Node J
d) Node G
Question 9. Which node among the successors of node I along the most-effective path (i.e., nodes that can be reached from node I) is least promising?
a) Node E
b) Node H
c) Node J
d) Node G
Question 10. What is the most cost-effective path to reach goal state J from start state A using the A Algorithm?*
a) A-F-H-I-J
b) A-B-D-E-J
c) A-B-C-E-J
d) A-F-G-I-J
These are Fundamentals of Artificial Intelligence Week 2 Answers
