DOEACC Society 2006 DOEACC B Level BE2 AI and Applications ( ) - Question Paper

BE2-R3: ARTIFICIAL INTELLIGENCE AND APPLICATIONS
NOTE:
Time: three Hours Total Marks: 100
1.
a) explain with examples the scope and limitations of knowledge representation using:
i) Propositional Logic
ii) 1st Order Predicate Logic
b) discuss the principles of means_end-analysis approach to issue solving.
c) discuss the desirable characteristics of control strategies as used in production systems.
d) Justify the statement-A game tree is an AND/OR tree.
e) Draw CD representation of the subsequent sentence:
‘John broke windows with hammer’
f) Let Y and R be 2 fuzzy sets of young and rich people. What is the member grade of person
being young and rich if the member grade of a person being is 0.8 and being rich is 0.7?
g) discuss goal stack and goal set approaches in the situation of planning.
(7x4)
2.
a) A list is a palindrome if it reads the identical in the forward and in backward direction. For
example [k,a,n,a,k]. Write a complete Prolog program to check if a list is a palindrome. provide a
brief explanation.
b) Using Waltz’s junction leveling algorithm, recognize the subsequent line drawings and comment
on it.
(9+9)
3.
a) discuss the difference ranging from forward and backward chaining and under what conditions
every would be best to use for a provided set of issues.
b) Using Prolog clauses, describe the relation dividelist(List, List1, List2) so that the elements of
List are partitioned ranging from List1 and List2, where List1 and List2 contain old and even
position elements of List. List1 and List2 are of approximately identical length. For example,
dividelist([a,b,c,d,e], [a,c,e], [b,d]) is actual.
(9+9)
BE2-R3 Page one of two July, 2006
1. ans ques. one and any 4 ques. from two to 7.
2. Parts of the identical ques. should be answered together and in the identical
sequence.
4.
a) Consider the game of tic-tac-toe. presume MAX marks crosses(X) and MIN marks circles(O);
MAX is to play first.
If p is not a winning position for either player, provide an valuation function e(p) for use by MAX
to evaluate non-terminal positions. Show the game tree up to lookahead depth as two and run
MINIMAX algorithm on this game tree using your valuation function.
b) Prove that dog(fido) follows from the subsequent statements by the resolution theorem.
i) " X bark(X) ® dog(X)
ii) " X " Y $ Z has-master (X, Y) Ù likes (X, Y) Ù
unprecedented-situation (Z) ® barks(X)
iii) Unprecedented-situation(noise).
iv) Likes (fido, jim).
v) Has-master (fido, jim).
(9+9)
5.
a) What do you mean by consistency of a heuristic function?
b) Validate every of the subsequent statements giving brief explanation.
i) The heuristic function ‘Sum of manhattan distances’ for 8-puzzle issue is consistent.
ii) If heuristic is consistent then the heuristic is admissible but the converse is not actual.
iii) The Algorithm A* expands a node almost once if the heuristic is consistent.
(3+[4+6+5])
6. List the order in which nodes are visited in the tree beneath for every of the subsequent three
search strategies(choosing leftmost branches 1st in all cases):
a) Depth-first Search
b) Depth-first iterative-deepening Search (increasing the depth by one in every iteration)
c) Breadth-first Search
(6+6+6)
7.
a) What is an Expert System? How do you distinguish ranging from a Knowledge Based System and
an Expert System? define in short the 4 major issues faced by Expert systems?
b) discuss the key idea of bayesian statistics for representing knowledge. Is it possible to
calculate P(A|~B) when you are only provided P(A), P(B|A) and P(B). discuss your ans.
c) 8-Queens issue seeks to place eight queens in an 8X8 chessboard such that no 2 queens
attack every other. Formulate this issue as a constrained satisfaction issue.
BE2-R3 Page two of two July, 2006
1
2 three 4
5 six seven eight 9
1 one 1 1
(6+6+6)
BE2-R3 Page three of two July, 2006

Earning:   Approval pending.