Artificial Intelligence Search Methods For Problem solving Week 2
Are you looking for Artificial Intelligence Search Methods For Problem solving Week 2 ? You’ve come to the right place! Access the latest and most accurate solutions for your Week 2 assignment in the Artificial Intelligence Search Methods For Problem solving Week 1 course
Course Link: Click Here
Table of Contents
Artificial Intelligence Search Methods For Problem solving Week 2 Nptel Answers
Week 2 GA – State Space Example
Q1. What information is available in Week 2 notes (bunch of PDFs) published in the course page?
About node order and tie breaker
How to model a problem as a state space search problem
Some properties of state spaces
DFS, BFS, DBDFS algorithms and ancillary functions
DFID-N, DFID-C algorithms and ancillary functions
Examples of list and tuple operations
Solved lecture examples
Solutions to practice assignment problems
Some problems to demonstrate node order
Answer: Updating Soon (In Progress)
Q2. Which of the following states satisfy the capacity constraints of the 12-9-7 water jug puzzle?
(3, 2, 7)
(3, 4, 5)
(1, 9, 2)
(0, 4, 8)
Answer: Updating Soon (In Progress)
For answers or latest updates join our telegram channel: Click here to join
These are Artificial Intelligence Search Methods For Problem solving Week 2 Assignment Nptel Answers
Q3From the state (7, 0, 5), which of the following states can be reached in one or more moves?
(3, 2, 7)
(3, 4, 5)
(1, 9, 2)
(0, 4, 8)
Answer: Updating Soon (In Progress)
Q4. From the state (3,2,7) the least number of moves required to reach (2,3,7) is __________ .
Answer: Updating Soon (In Progress)
For answers or latest updates join our telegram channel: Click here to join
These are Artificial Intelligence Search Methods For Problem solving Week 2 Assignment Nptel Answers
Q5. From the state (2,3,7) the least number of moves required to reach (3,2,7) is __________ .
Answer:
Q6.Say true or false. In the 12-9-7 water jug puzzle, it is possible to measure all the integral volumes 1L, 2L, …, up to 12L, where each volume measured is present in a single jug.
True
False
Cannot be determined
Answer: Updating Soon (In Progress)
For answers or latest updates join our telegram channel: Click here to join
These are Artificial Intelligence Search Methods For Problem solving Week 2 Assignment Nptel Answers
Q7.The state space shown above __ .
is the full state space for the 12-9-7 water-jug puzzle
is the subspace reachable from the state (12,0,0)
satisfies the “reversible state space” property
does not satisfy the “reversible state space” property
Answer:
Week 2 GA – CLOSED LIST
Q1.Which of the following are possible valid orders in which Depth First Search visits the next 5 nodes starting from K?
K E J P O L
K J I N P Q
K E B A D J
K P Q R O S
K F L J I N
Answer:
For answers or latest updates join our telegram channel: Click here to join
These are Artificial Intelligence Search Methods For Problem solving Week 2 Assignment Nptel Answers
Q2.Which of the following are possible valid orders in which Breadth First Search visits the next 5 nodes starting from K?
K E J P O L
K J I N P Q
K E L O P J
K P Q R O S
K F L J I N
Answer:
Q3. Which of the following are possible valid orders in which Depth First Search visits the next 5 nodes starting from G?
G H G L F C
G H M L F C
G L Q P K L
G L Q W X Z
G L Q W X W
Answer:
For answers or latest updates join our telegram channel: Click here to join
These are Artificial Intelligence Search Methods For Problem solving Week 2 Assignment Nptel Answers
Q4. Which of the following are possible valid orders in which Breadth First Search visits the next 5 nodes starting from G?
G H G L F C
G H M F L C
G L Q P K L
G F L M H Q
G F L M H C
Answer:
Week 2 GA – DFS, BFS and DBDFS
Q1. The BFS search tree is __________ .
Tree 1
Tree 2
Tree 3
Tree 4
Answer:
For answers or latest updates join our telegram channel: Click here to join
These are Artificial Intelligence Search Methods For Problem solving Week 2 Assignment Nptel Answers
Q2. When BFS finds the goal node, i.e., when the GoalTest returns true, the NODEs present in OPEN list are __ .
The OPEN list contains pairs (NODE,PARENT), ignore the PARENTs and list only the NODEs in the order it occurs in the OPEN list (head to tail).
Answer:
Q3. List the nodes inspected by BFS. Enter the nodes in the order they were inspected.
Answer:
For answers or latest updates join our telegram channel: Click here to join
These are Artificial Intelligence Search Methods For Problem solving Week 1 Assignment Nptel Answers
Q4. What is the path found by BFS?
Answer:
Q5. The DFS search tree is __________ .
Tree 1
Tree 2
Tree 3
Tree 4
Answer:
For answers or latest updates join our telegram channel: Click here to join
These are Artificial Intelligence Search Methods For Problem solving Week 2 Assignment Nptel Answers
Q6.When DFS finds the goal node, i.e., when the GoalTest returns true, the NODEs present in OPEN list are __ .
The OPEN list contains pairs (NODE,PARENT), ignore the PARENTs and list only the NODEs in the order it occurs in the OPEN list (head to tail).
Answer:
Q7. List the nodes inspected by DFS. Enter the nodes in the order they were inspected.
a computer program to find proofs
a mathematician who works on Logic
a program designed by Herbert Simon and Alan Newell
a logic based chess player
Answer:
For answers or latest updates join our telegram channel: Click here to join
These are Artificial Intelligence Search Methods For Problem solving Week 2 Assignment Nptel Answers
Q8. What is the path found by DFS?
Answer:
Q9. When DBDFS (depthBound=2) finds the goal node, i.e., when the GoalTest returns true, the NODEs present in OPEN list are __ .
The OPEN list contains pairs (NODE,PARENT), ignore the PARENTs and list only the NODEs in the order it occurs in the OPEN list (head to tail).
Answer:
Q10.List the nodes inspected by DBDFS (depthBound=2). Enter the nodes in the order they were inspected.
Q11. What is the path found by DBDFS (depthBound=2)?
Q12.Which of the following search algorithm(s) always find(s) a path to the goal (if there exists one) in an infinite search space.
DFS
BFS
DFID-C
None of the above
Q13.Mark the algorithm(s) for which space requirements for OPEN grow linearly with depth.
DFS
BFS
DFID-C
None of the above
Q14.Mark the algorithm(s) that always find(s) the shortest path from start state to goal state in any search space.
DFS
BFS
DFID-C
None of the above
For answers or latest updates join our telegram channel: Click here to join
These are Artificial Intelligence Search Methods For Problem solving Week 2 Assignment Nptel Answers
More Weeks of Artificial Intelligence Search Methods For Problem solving: Click here
More Nptel Courses: https://progiez.com/nptel-assignment-answers
