Answer Submitted.

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

[email protected] 

NPTEL (https://swayam.gov.in/explorer?ncCode=NPTEL) » Artificial Intelligence : Search Methods For

Problem solving (course)

Course
Week 2 PA - BFS Example
outline Assignment not submitted

About Note : This assignment is only for practice purpose and it will not be counted towards the
NPTEL () Final score

How does an
NPTEL Use the DFS/BFS/DFID-N/DFID-C algorithms published in Week 2 notes. More importantly, pay
online attention to the order in which nodes are opened and closed by the algorithms. The answers
course depend on the order in which nodes are processed and how lists are created and read by the
work? () algorithms.

Pre-requisite A state space is shown below, where the start state is S and the goal state is G, the two way
assignment
edges (reversible moves) are shown as undirected edges and one way edges (irreversible
()
moves) are shown as directed edges. The MoveGen function returns neighbours in alphabetical
order.
Week 0 ()

Week 1 ()

Week 2 ()

State Space
Search (unit?
unit=38&lesso Run the BFS algorithm given in Week 2 notes, it adds only new neighbours to OPEN list, i.e.,
n=39) neighbours that are not present in OPEN or CLOSED lists. Run the algorithm to completion then
Domain answer the questions in this section.
Independent
1) A few MoveGen functions are listed here. 1 point
Algorithms
(unit?
unit=38&lesso X MoveGen1(X) MoveGen2(X) MoveGen3(X)
n=40) -- ----------- ----------- -----------
S [A,C] [A,C] [A,C]
Deterministic
A [B,C,D,S] [B,C,D,S] [B,C,S]
Search (unit?
unit=38&lesso B [A,D,E] [A,D,E] [A,D,E]
n=41) C [A,D,S] [A,D,S] [A,D,S]
D [A,B,C,G] [A,B,C,E,G] [B,C,E,G]
DFS and BFS
E [B,G] [B,D,G] [B,D,G]
(unit?
G [D,E] [D,E] [D,E]
unit=38&lesso
n=42)
Select the MoveGen that matches the given state space.
Comparing
DFS and BFS
(unit? MoveGen1
unit=38&lesso
MoveGen2
n=43)
MoveGen3
Depth First
None of the above
Iterative
Deepening Yes, the answer is correct.
(unit? Score: 1
unit=38&lesso Accepted Answers:
n=44) MoveGen2

Lecture 2) When BFS searches the state space, what is the 4th node inspected?
Materials
(unit? Enter a node label.
unit=38&lesso
NO SPACES, TABS, DOTS, BRACKETS, PARENTHESIS OR EXTRANEOUS CHARACTERS.
n=46)

Quiz: Week 2 Answer Format: X

GA - State
Space
Example B
(assessment?
name=265) Yes, the answer is correct.
Score: 1
Quiz: Week 2 Accepted Answers:
GA - CLOSED (Type: String) B
LIST
(assessment? 1 point
name=266) 3) When BFS searches the state space, after the 4th node is inspected, what are the contents
Quiz: Week 2 of OPEN list? List the nodes present in the OPEN list in head to tail order. For simplicity, ignore
GA - DFS, the parent node in each pair and list only the node.
BFS and
DBDFS Enter the node labels as a comma separated list.
(assessment? NO SPACES, TABS, DOTS, BRACKETS, PARENTHESIS OR EXTRANEOUS CHARACTERS.
name=267)

Practice: Week Answer Format: X,Y,Z

2 PA - Lists
and Tuples
(assessment? D,E
name=270)
Yes, the answer is correct.
Practice: Week Score: 1
2 PA - Accepted Answers:
Assignment (Type: String) D,E
and 1 point
Comparison
(assessment? 4) When BFS searches the state space, after the 4th node is inspected, what are the contents
name=271) of CLOSED list? List the nodes present in the CLOSED list in head to tail order. For simplicity,
ignore the parent node in each pair and list only the node.
Practice: Week
2 PA -
Enter the node labels as a comma separated list.
Functions
NO SPACES, TABS, DOTS, BRACKETS, PARENTHESIS OR EXTRANEOUS CHARACTERS.
(assessment?
name=272)
Answer Format: X,Y,Z
Practice: Week
2 PA - State
Spaces and B,C,A,S
MoveGen
(assessment? Yes, the answer is correct.
name=274) Score: 1
Accepted Answers:
Practice: Week (Type: String) B,C,A,S
2 PA - OPEN
LIST 1 point
(assessment?
5) What is the path found by BFS?
name=263)

Practice: Week Enter the path as a comma separated list of node labels. Enter NIL if there is no path.
2 PA - NO SPACES, TABS, DOTS, BRACKETS, PARENTHESIS OR EXTRANEOUS CHARACTERS.
CLOSED LIST
(assessment?
Answer Format: S,X,Y,G
name=269)

Practice: Week
2 PA - Search S,A,D,G
Tree
Yes, the answer is correct.
(assessment?
Score: 1
name=264)
Accepted Answers:
Practice: Week (Type: String) S,A,D,G
2 PA - State
Space
1 point
Example 6) At the point when BFS finds the goal node, i.e., GoalTest returns true, what are the contents
(assessment?
of OPEN list? List the nodes in head to tail order. For simplicity, ignore the parent in each pair and
name=273)
list only the node.
Practice:
Week 2 PA - Enter the node labels as a comma separated list.
BFS Example NO SPACES, TABS, DOTS, BRACKETS, PARENTHESIS OR EXTRANEOUS CHARACTERS.
(assessment?
name=277)
Answer Format: X,Y,Z
Practice: Week
2 PA - DFS
Example G
(assessment?
Yes, the answer is correct.
name=276) Score: 1
Practice: Week Accepted Answers:
2 PA - DFID-N (Type: String) G
Example
1 point
(assessment?
name=278) 7) Four search trees (at the time when GoalTest returned true) are shown below. The 1 point
Practice: Week CLOSED nodes are blue filled and the OPEN nodes are white filled.
2 PA - DFID-C
Example
(assessment?
name=279)

Practice: Week
2 PA -
Deterministic
Search – DFS/
BFS/DFID
(assessment?
name=275)

Week 2
Feedback
Identify the BFS search tree.
Form: Artificial
Intelligence :
Search
Tree 1
Methods For
Problem Tree 2
solving (unit? Tree 3
unit=38&lesso
Tree 4
n=164)
Yes, the answer is correct.
Week 3 () Score: 1
Accepted Answers:
Week 4 () Tree 2

Week 5 () Check Answers and Submit

Your score is: 7/7

Week 6 ()

Week 7 ()

Week 8 ()

Week 9 ()

Week 10 ()

Week 11 ()

Week 12 ()

DOWNLOAD
VIDEOS ()

Text
Transcripts ()

Books ()

Problem