Rajiv Gandhi Proudyogiki Vishwavidyalaya 2008-4th Sem M.C.A Computer Aplications .(ester) , ., - Question Paper

MCA-401
M.C.A.(Fourth Semester) EXAMINATION, Dec., 2008
ARTIFICIAL INTELLIGENCE AND APPLICATIONS
(MCA-401)
Time : 3 Hours
Maximum Marks : 100
Minimum Pass Marks : 40

Note : Attempt any 1 ques. from every Unit.All ques. carry equal marks. Answers should
be brief and to the point.

Unit - I
1.(a) Why AI can be described as the solution of exponentially hard issues in P-time (or less) ?
Other definitions of AI that are 'human' oriented
(b) The subsequent Prolog relation appends a list A to list B to
provide a list C.
append ([],Y,Y).
append([H|T],Y,[H|Z]) :- append (T,Y,Z).

Using the append relation, write a Prolog predicate insert(X,Y,Z) that is actual if X can be
inserted into a list Y to provide a list Z. Your relation should be capable of using backtracking
to generate all lists found from Y by inserting X at a few point,using a query such as :
insert(c,[a,b],Z).
to find Z =[c,a,b],Z=[a,c,b], and Z=[a,b,c] it should generated every possibility
exactly onec.
Using the insert relation,write Prolog predicate perm (X,Y) that is actual if a list Y is a
permutation of a list X. Your predicate should respond to a query such as perm ([a,b,c],Y) by
using backtracking to generate all permutations of the provided list.

Or
2.(a) "AI is becoming less conspicuous yet more essential". Comment.
(b) How to write a "Hello World" programme in Lisp ?

Unit - II
3.(a) define the role of heuristics and the need for tradeoffs ranging from optimality and efficiency.
(b) discuss how simulated annealing can be used to decrease search complexity and contrast its
operation with classic search techniques ?
Or
4.(a) Characterize the components of non-monotonic reasoning and its usefulness as a
representational mechanisms for belief systems.
(b) provide an example of a issue for which breadth 1st search would work better than depth first
search.

Unit - III
5. Consider the subsequent story of the play Macbeth, by William Shakespeare. The characters are
Macbeth, Lady-Macbeth. Duncan and Macduff. Macbeth is an evil noble. lady Macbeth is a greedy
ambitious woman. Duncan is a king. Macduff is a loyal noble. Macbeth is weak because Macbeth
married Lady Macbeth and because Lady Macbeth is greedy. Lady Macbeth persuades Macbeth
to want to be king. Macbeth murders Duncan using a knife because Macbeth wants to be king and
because Macbeth is evil. Lady Macbeth kills Lady-Macbeth. Macduff is angry because Macbeth
murdered Duncan and because Macduff is loyal to Duncan. Macduff kills Macbeth. Construct a
semantic network representing the above story. Show the chain of reasoning leading to Macduff
killing Macbeth. It is possible to change the story so that Lady Macbeth is unable to Persuade
Macbeth to want to be king. Augment the storyto give a cause for Lady Macbeth's inability
to persuade. Macbeth to want to be king. Update the semantic network to reflect the new
situation.
Or
6.(a) Illustrate the use of predicate logic to represent the knowledge with suitable example.
(b) Devise a semantic network capable of representing propositions of the subsequent types :
John loves Mary more than she loves him.
John thinks that Mary does not love him.
John thinks that Mary does not love him, but she does love him.

Unit - IV
7.(a) Most game playing programs donot save search outcomes from 1 move to the next. Instead, they
usually begin completely afresh whenever it is the machine's turn to move. Why ?
(b) Make the augmented transition network for the subsequent sentence :
"The dog likes a man" discuss steps.
Or
8.(a) define the STRIPS language for respresenting states, goals and operators within a planning
system.
(b) provide a definition of a plan, a consistent plan and a complete plan.
(c) define the initial plan used as a starting point by the partial-order planning algorithm.
(d) Outline the way in whichthe partial-order planning algorithm constructs a plan beginning with
the initial plan. Include in your ans a description of a threat along with an explanation
of how the algorithm can attempt to remove threats by promotion or demotion.

Unit - V
9.(a) explain the advantages and shortcomings of probabilistic reasoning.
(b) discuss the differences among the 3 main styles of learning :
(i) Supervised
(ii) Reinforcement
(iii) Unsupervised

Or
10. provide short definitions of any ten of the subsequent terms :
(i) Circumscription
(ii) Situation Calculus
(iii) Closed world Assumption
(iv) Expert System
(v) Automatic Discovery of Heuristics
(vi) Inter-Wave Search
(vii) Abduction
(ix) Microworld
(x) Maximum Expected Utility
(xi) Intelligent Agent Architecture
(xii) Fuzzy Control
(xiii) Constraint
(xiv)Problem Space(or Search Space)
(xv) Nov-Monotonic Reasoning.

Earning:   Approval pending.