8/4/23, 9:28 AM Fundamentals Of Artificial Intelligence - - Unit 4 - Week 2: Problem Solving by Search - I

(https://swayam.gov.in) (https://swayam.gov.in/nc_details/NPTEL)

meenakshi.eee@sairam.edu.in 

NPTEL (https://swayam.gov.in/explorer?ncCode=NPTEL) » Fundamentals Of Artificial Intelligence

(course)

If already
registered, click
to check your
Assignment 2
payment status Your last recorded submission was on 2023-08-03, 21:15 Due date: 2023-08-09, 23:59 IST.
IST

1) The principal gain, often spectacular, of using a heuristic function is the _________ 1 point
Course
outline A. use of domain knowledge.
B. estimate of a path to the goal.
How does an C. reduction of the search space.
NPTEL D. rank the child nodes.
online
course
2) Heuristics created as solutions to relaxed problems are usually _________ because 1 point
work? ()
adding new actions should only reduce the solution cost and not increase it.

Week 0: A. Optimal
Prerequisites
B. Minimal cost
()
C. Admissible
Week 1: AI D. Pessimistic
and AI
Problem 3) There is a special class of heuristics called admissible heuristics, which possess 1 point
Solving () some desirable properties. Which of the following statements are true for an admissible
heuristic?
Week 2:
Problem A. They are optimistic heuristics because they can only underestimate the cost.
Solving by B. Admissible heuristics break optimality by trapping good plans on the fringe.
Search - I ()
C. Never returns a value greater than the actual path cost to the nearest goal for any
Lec 1:
node.
Heuristic D. The null heuristic (which returns 0 for any node) is admissible!
Search (unit?
unit=22&lesson=23)

https://onlinecourses.nptel.ac.in/noc23_ge40/unit?unit=22&assessment=116 1/3
8/4/23, 9:28 AM Fundamentals Of Artificial Intelligence - - Unit 4 - Week 2: Problem Solving by Search - I

Lec 2: 4) A* generates an optimal solution under which of the following conditions? Condition 1 point
Informed 1: If h(n) is an admissible heuristic and the search space is a tree. Condition 2: If h(n) is a
Search (unit? consistent heuristic and the search space is a graph.
unit=22&lesson=24)
A. A* never generate an optimal solution.
Lec 3:
Constraint
B. Condition 1 only
Satisfaction C. Both Condition 1 and Condition 2
Problems D. Condition 2 only
(unit?
unit=22&lesson=25)
5) A solution to a CSP is a complete assignment that satisfies all the constraints. 1 point
Quiz: Which of the two are true for a solution to a CSP? I. An assignment that does not violate any
Assignment 2 constraints is called consistent or legal. II. A complete assignment is one in which every variable
(assessment? is mentioned.
name=116)
A. Neither I nor II
Feedback
Form week 2 B. Both I and II
(unit? C. I Only
unit=22&lesson=26)
D. II Only
Text For Q6. – Q10. Consider the following graph and A* Algorithm. The nodes are marked by upper-
Transcripts ()
case letters; the numbers written by the nodes represent their heuristic value. The numbers on
the edge is the cost of traversing that particular edge i.e., distance between the nodes.
Books ()

6) The A* search algorithm is based on ___________. 1 point

A. Breadth-First-Search
B. Depth-First –Search
C. Best-First-Search
D. Hill climbing

https://onlinecourses.nptel.ac.in/noc23_ge40/unit?unit=22&assessment=116 2/3
8/4/23, 9:28 AM Fundamentals Of Artificial Intelligence - - Unit 4 - Week 2: Problem Solving by Search - I

7) Starting with node A; node B and node F can be reached from node A. Which node 1 point
does algorithm A* considers next? Why?

A. Node F; f(F) > f(B).

8) Which node among the successors of node I along the most-effective path (i.e., 1 point
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

9) Which node among the successors of node I along the most-effective path (i.e., 1 point
nodes that can be reached from node I) is least promising?

A. Node E
B. Node H
C. Node J
D. Node G

10) What is the most cost-effective path to reach from start state A to goal state J using 1 point
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

You may submit any number of times before the due date. The final submission will be
considered for grading.
Submit Answers

https://onlinecourses.nptel.ac.in/noc23_ge40/unit?unit=22&assessment=116 3/3