Scribd
Upload
86 views2 pages

AI - SMPS - Unit 6 - Week 2

The document outlines instructions and quiz questions for the NPTEL course on Artificial Intelligence, specifically focusing on search methods for problem solving. It details the marking scheme for multiple-choice questions and provides examples of correct answers for various scenarios in depth-first search (DFS) and breadth-first search (BFS). The document also includes a record of the user's last submission and their score for the quiz.

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
86 views2 pages

AI - SMPS - Unit 6 - Week 2

The document outlines instructions and quiz questions for the NPTEL course on Artificial Intelligence, specifically focusing on search methods for problem solving. It details the marking scheme for multiple-choice questions and provides examples of correct answers for various scenarios in depth-first search (DFS) and breadth-first search (BFS). The document also includes a record of the user's last submission and their score for the quiz.

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/ 2

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 - OPEN LIST
outline Your last recorded submission was on 2024-10-24, 20:07 IST
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 Marking scheme for MCQs with more than one correct answer:
course
• Full marks, if all correct options are selected and no wrong option is selected.
work? ()
• Partial marks, if some correct options are selected and no wrong option is selected.

Pre-requisite • Zero marks, if at least one wrong option is selected.


assignment • Zero marks, if no options are selected.
()
1) Let OPEN be [P, Q, R, S, T, U, V, W] then __________ . Mark all correct answers. 1 point

Week 0 () BFS picks node P and applies the GoalTest function to P


DFS picks node P and applies the GoalTest function to P
Week 1 ()
BFS picks node W and applies the GoalTest function to W

Week 2 () DFS picks node W and applies the GoalTest function to W

Yes, the answer is correct.


State Space Score: 1
Search (unit? Accepted Answers:
unit=38&lesso BFS picks node P and applies the GoalTest function to P
n=39)
DFS picks node P and applies the GoalTest function to P
Domain
2) Let OPEN=[N, A, F, L, T]. When DFS picks up node N from OPEN and calls 1 point
Independent
GoalTest(N) which returns FALSE then __________ .
Algorithms
(unit?
Algorithm DFS will terminate and return FAILURE
unit=38&lesso
n=40) Algorithm DFS will call MoveGen(N)
Deterministic Algorithm DFS will pick the next node A from [A, F, L, T]
Search (unit? Algorithm DFS will pick the next node T from [A, F, L, T]
unit=38&lesso
n=41) Yes, the answer is correct.
Score: 1
DFS and BFS Accepted Answers:
(unit? Algorithm DFS will call MoveGen(N)
unit=38&lesso
n=42) 3) Let OPEN=[N, A, F, L, T]. When BFS picks up node N from OPEN and calls 1 point
GoalTest(N) which returns FALSE then __________ .
Comparing
DFS and BFS Algorithm BFS will terminate and return FAILURE
(unit?
Algorithm BFS will call MoveGen(N)
unit=38&lesso
n=43) Algorithm BFS will pick the next node A from [A, F, L, T]
Algorithm BFS will pick the next node T from [A, F, L, T]
Depth First
Iterative Yes, the answer is correct.
Deepening Score: 1
(unit? Accepted Answers:
unit=38&lesso Algorithm BFS will call MoveGen(N)
n=44)
4) Let OPEN= [N, A, F, L, T] and DFS has called MoveGen(N) and the list of new 1 point
Lecture nodes (to be added to OPEN) is [M, B, H]. The updated OPEN will be __________ .
Materials
(unit? [A,F,L,T,M,B,H]
unit=38&lesso
[A,B,F,H,L,M,T]
n=46)
[M,B,H,A,F,L,T]
Quiz: Week 2
[A,F,L,T,B,M,H]
GA - State
Space Yes, the answer is correct.
Example Score: 1
(assessment? Accepted Answers:
name=265) [M,B,H,A,F,L,T]

Quiz: Week 2 5) Let OPEN=[N, A, F, L, T] and BFS has called MoveGen(N) and the list of new nodes 1 point
GA - CLOSED (to be added to OPEN) is [M, B, H]. The updated OPEN will be __________ .
LIST
(assessment? [A,F,L,T,M,B,H]
name=266)
[A,B,F,H,L,M,T]
Quiz: Week 2 [M,B,H,A,F,L,T]
GA - DFS,
[A,F,L,T,B,M,H]
BFS and
DBDFS Yes, the answer is correct.
(assessment? Score: 1
name=267) Accepted Answers:
[A,F,L,T,M,B,H]
Practice: Week
2 PA - Lists
Check Answers and Submit
and Tuples
(assessment? Your score is: 5/5
name=270)

Practice: Week
2 PA -
Assignment

You might also like