CS607 – Artificial Intelligence

Assignment # 01 - Fall 2019

ID
Solution
Question 1
Given the following graphs convert it into tree data structure.
A) In the following graph consider node 1 as your starting point

Answer

2 3

2 5
4

6
5 6
4

6
5 6
B) In the following graph consider node a as your starting point.

Answer

b c

d e

g f

h
Question No. 2
Consider the search space below, where S is the start node and H is goal node. Show
with the sequence of diagrams along with table displaying how does BFS work on given
tree using simple search algorithm.

Answer

Q Visited
01 S S
02 L,M S,L,M
03 M,N,O S,L,M,N,O
04 N,O,P,Q S,L,M,N,O,P,Q
05 O,P,Q,R,T S,L,M,N,O,P,Q,R,T
06 P,Q,R,T,U S,L,M,N,O,P,Q,R,T,U
07 Q,R,T,U,V,H S,L,M,N,O,P,Q,R,T,U,V,H
08 R,T,U,V,H,I S,L,M,N,O,P,Q,R,T,U,V,H,I
09 T,U,V,H,I S,L,M,N,O,P,Q,R,T,U,V,H,I
10 U.V.H.I S,L,M,N,O,P,Q,R,T,U,V,H,I
11 V,H,I, S,L,M,N,O,P,Q,R,T,U,V,H,I
12 H,I S,L,M,N,O,P,Q,R,T,U,V,H,I
13 I S,L,M,N,O,P,Q,R,T,U,V,H,I