0% found this document useful (0 votes)
6 views

AI_SMPS-Unit 6 - Week 2.2

The document outlines an assignment for the NPTEL course on Artificial Intelligence, specifically focusing on search methods for problem-solving. It provides instructions for submitting answers and emphasizes the importance of following specific formats to avoid loss of marks. The assignment includes various questions related to search trees and algorithms such as DFS, BFS, and DBDFS, with examples of expected answer formats.

Uploaded by

chittoras
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
6 views

AI_SMPS-Unit 6 - Week 2.2

The document outlines an assignment for the NPTEL course on Artificial Intelligence, specifically focusing on search methods for problem-solving. It provides instructions for submitting answers and emphasizes the importance of following specific formats to avoid loss of marks. The assignment includes various questions related to search trees and algorithms such as DFS, BFS, and DBDFS, with examples of expected answer formats.

Uploaded by

chittoras
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

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 - Search Tree
outline Assignment not submitted
IMPORTANT: Please read the instructions carefully. For short answers your answer MUST
About FOLLOW THE FORMAT STATED IN EACH QUESTION. By default, we use COMMA as the
NPTEL () separator for entering a list of values. DO NOT ENTER ANY BLANKS, FULL STOPS, TABS,
PARENTHESIS or EXTRANEOUS CHARACTERS in the short answer. Any deviation will result in
How does an loss of marks because the answers are EVALUATED BY STRING MATCHING.
NPTEL
online IMPORTANT: refer Week 2 Notes and solve the practice assignments before solving this
course assignment.
work? ()
Use the DFS, BFS, DBDFS and DFID-N algorithms published in Week 2 Notes.
Pre-requisite
assignment
A search tree (not the state space) at the point when GoalTest returns true is shown below. The
()
start node is S and the goal node is G. Study the search tree, then answer the questions.

Week 0 ()

Week 1 ()

Week 2 ()

State Space
Search (unit?
unit=38&lesso
n=39)

Domain
Independent IMPORTANT: In assignments and exams, when we say a node is inspected (or expanded or
Algorithms refined) it means: the node is read from OPEN and GoalTest is called, if it returns true then the
(unit? node is processed as a goal, otherwise MoveGen is called and the neighbours are selectively
unit=38&lesso
n=40) placed in OPEN.

Deterministic
Search (unit? 1) DFS has just finished inspecting H, now list the contents of OPEN.
unit=38&lesso
n=41)
The OPEN list contains pairs (NODE,PARENT), ignore the PARENTs and list only the NODEs in
DFS and BFS the order it occurs in the OPEN list (head to tail).
(unit?
unit=38&lesso Enter a comma separated list of nodes, or enter NIL if the list is empty.
n=42) Answer Format: X,Y,Z
Comparing
I,D,B
DFS and BFS
(unit? Yes, the answer is correct.
unit=38&lesso Score: 1
n=43) Accepted Answers:
(Type: String) I,D,B
Depth First
Iterative 1 point
Deepening
(unit? 2) DFS has just finished inspecting H, now list the contents of CLOSED.
unit=38&lesso
n=44) The CLOSED list contains pairs (NODE,PARENT), ignore the PARENTs and list only the NODEs
in the order it occurs in the CLOSED list (head to tail).
Lecture
Materials
(unit? Enter a comma separated list of nodes, or enter NIL if the list is empty.
unit=38&lesso Answer Format: X,Y,Z
n=46)
H,C,A,S
Quiz: Week 2
GA - State Yes, the answer is correct.
Space Score: 1
Example Accepted Answers:
(assessment? (Type: String) H,C,A,S
name=265)
1 point
Quiz: Week 2
3) DFS has just finished inspecting H, now list all the nodes inspected so far. Enter the nodes
GA - CLOSED
in the order they were inspected.
LIST
(assessment?
name=266) Enter a comma separated list of node labels.
Answer Format: X,Y,Z
Quiz: Week 2
GA - DFS, S,A,C,H
BFS and
DBDFS Yes, the answer is correct.
(assessment? Score: 1
name=267) Accepted Answers:
(Type: String) S,A,C,H
Practice: Week
2 PA - Lists 1 point
and Tuples
4) BFS has just finished inspecting H, now list the contents of OPEN.
(assessment?
name=270)
The OPEN list contains pairs (NODE,PARENT), ignore the PARENTs and list only the NODEs in
Practice: Week the order it occurs in the OPEN list (head to tail).
2 PA -
Assignment
Enter a comma separated list of nodes, or enter NIL if the list is empty.
and Answer Format: X,Y,Z
Comparison
(assessment? I,J,K,L,M,G,N
name=271)
Yes, the answer is correct.
Practice: Week Score: 1
2 PA - Accepted Answers:
Functions (Type: String) I,J,K,L,M,G,N
(assessment?
1 point
name=272)
5) BFS has just finished inspecting H, now list the contents of CLOSED.
Practice: Week
2 PA - State
Spaces and The CLOSED list contains pairs (NODE,PARENT), ignore the PARENTs and list only the NODEs
MoveGen in the order it occurs in the CLOSED list (head to tail).
(assessment?
name=274) Enter a comma separated list of nodes, or enter NIL if the list is empty.
Practice: Week
Answer Format: X,Y,Z
2 PA - OPEN
H,F,E,D,C,B,A,S
LIST
(assessment? Yes, the answer is correct.
name=263) Score: 1
Accepted Answers:
Practice: Week
(Type: String) H,F,E,D,C,B,A,S
2 PA -
CLOSED LIST 1 point
(assessment?
name=269) 6) BFS has just finished inspecting H, now list all the nodes inspected so far. Enter the nodes
in the order they were inspected.
Practice:
Week 2 PA -
Enter a comma separated list of node labels.
Search Tree
(assessment? Answer Format: X,Y,Z
name=264)
S,A,B,C,D,E,F,H
Practice: Week
2 PA - State Yes, the answer is correct.
Score: 1
Space
Example
Accepted Answers:
(assessment? (Type: String) S,A,B,C,D,E,F,H
name=273)
1 point
Practice: Week
7) DBDFS (for depthBound=2) has just finished inspecting C, now list the contents of OPEN.
2 PA - BFS
Example
The OPEN list contains pairs (NODE,PARENT), ignore the PARENTs and list only the NODEs in
(assessment?
name=277) the order it occurs in the OPEN list (head to tail).

Practice: Week Enter a comma separated list of nodes, or enter NIL if the list is empty.
2 PA - DFS
Answer Format: X,Y,Z
Example
(assessment? D,B
name=276)
Yes, the answer is correct.
Practice: Week Score: 1
2 PA - DFID-N Accepted Answers:
Example
(Type: String) D,B
(assessment?
name=278) 1 point
Practice: Week 8) DBDFS (for depthBound=2) has just finished inspecting C, now list the contents of
2 PA - DFID-C CLOSED.
Example
(assessment? The CLOSED list contains pairs (NODE,PARENT), ignore the PARENTs and list only the NODEs
name=279) in the order it occurs in the CLOSED list (head to tail).

Practice: Week
2 PA - Enter a comma separated list of nodes, or enter NIL if the list is empty.
Deterministic Answer Format: X,Y,Z
Search – DFS/
BFS/DFID C,A,S
(assessment?
Yes, the answer is correct.
name=275) Score: 1
Week 2 Accepted Answers:
Feedback (Type: String) C,A,S
Form: Artificial
1 point
Intelligence :
Search 9) List all the nodes inspected by DBDFS (depthBound=2). Enter the nodes in the order they
Methods For were inspected.
Problem
solving (unit?
Enter a comma separated list of node labels.
unit=38&lesso
Answer Format: X,Y,Z
n=164)

S,A,C,D,B,E,F
Week 3 ()
Yes, the answer is correct.
Week 4 () Score: 1
Accepted Answers:
Week 5 () (Type: String) S,A,C,D,B,E,F

1 point
Week 6 ()
10) DFID-N has just finished inspecting H, now list the contents of OPEN.
Week 7 ()
The OPEN list contains pairs (NODE,PARENT,DEPTH), ignore the PARENT and DEPTH
Week 8 () information, and list only the NODEs in the order it occurs in the OPEN list (head to tail).

Week 9 () Enter a comma separated list of nodes, or enter NIL if the list is empty.
Answer Format: X,Y,Z
Week 10 ()
I,D,B

Week 11 () Yes, the answer is correct.


Score: 1
Week 12 () Accepted Answers:
(Type: String) I,D,B
DOWNLOAD
1 point
VIDEOS ()
11) List all the nodes inspected by DFID-N (for depth-bounds 0, 1, etc.) before it inspects node
Text E for the first time. The list may have duplicates if the same node is inspected multiple times.
Transcripts () Enter the nodes in the order they were inspected by DFID-N.

Books () Enter a comma separated list of node labels.


Answer Format: X,Y,Z
Problem
Solving S,S,A,B,S,A,C,D,B
Session -
July 2024 () Yes, the answer is correct.
Score: 1
Accepted Answers:
(Type: String) S,S,A,B,S,A,C,D,B

1 point
Check Answers and Submit

Your score is: 11/11

You might also like