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

MCA-401
M.C.A.(Fourth Semester) Examination,June,2009
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) Differentiate the concepts of optimal behaviour and human like behaviour.
(b) What a physical symbol system is and what the different components do ?
Or
(a) List examples of intelligent systems that depend on models of the world.
(b) How does (defun car(x) (car x)) work ?

Unit - II
2.(a) define the way in which a issue should be represented in order to allow its solution
using a heuristic search technique.
(b) describe what is meant for a search algorithm to be complete and to be optimal ?
(c) describe what it means for a heuristic function to be admissible and to be monotonic ?
(d) define the operation of the A* heuristic search algorithm.
(e) Prove that the A* heuristic search algorithm is optimal when applied in conjunction with a
monotonic heuristic. State the conditions under which the algorithm is also complete and
discuss why this is the case ?
Or
4. This ques. considers the monkey-and-bananas problem, in which there is a monkey in a room
with a few bananas hanging out of reach from the ceiling, but a box is available that will
enable the monkey to reach the bananas if the climbs onto it. Initially the monkey is at
location A, the bananas at B and the box at C. The monkey and box have height x, but if the
monkey climbs onto the box he will have height y, the identical as the bananas. The actions
available to the monkey include Go from 1 place to a different. Push an object from 1 place
to another, Climb onto an object and Grasp an object. Grasping outcomes in holding the object
if the monkey and object are in the identical place at the identical height.
(i) Write the initial state description using a representation of your option.
(ii) Write definitions of the 4 actions, providing at lowest a few obvious preconditions,
additions and deletions.
(iii) Suppose the monkey wants to fool the observers, who have gone to lunch, by grabbing
the bananas but leaving the box in its original place. Write this as a goal (but not
assuming the box is necessarily at location C) in the language of situation calculus.
(iv) If the box is filled with bricks,its position will remain the identical when the Push operator
is applied. Is this an example of the frame issue or the circumscription issue ?
Justify your ans.

Unit - III
5.(a) discuss what the terms ontological commitment and epistermological commitment mean in the
situation of a language for knowledge representation and reasoning. elaborate the ontological
and epistemological commitments made by propositional logic and by 1st order logic ?
(b) You wish to construct a robotic pet cat for the purpose of entertainment. 1 purpose of the
cat is to scratch valuable objects when the owner is not current. provide a brief general
description of situation calculus and define howit might be used for knowledge
representation by the robot. Include in your ans 1 example every of a frame axiom an
effect axiom, and a successor-state axiom, along with example definitions of suitable
predicates and function.
(c) provide a brief description of the representational frame problem, the inferential frame
problem, the qualification issue and the ramification issue.
Or
6. What issues would be encountered in attempting to represent the subsequent statements in
predicate logic ? It should be possible to deduce the final statement from the others :
(i) John only likes to see French movies.
(ii) It's safe to presume a move American unless explicitly told otherwise.
(iii)The Playhouse rarely indicates foreign films.
(iv) People don't do things that will reason them to be in situations that they don't like.
(v) John doesn't go to the Playhouse very often.

Unit - IV
7. discuss how the Alpha-Beta Algorithm is a better way to search game trees. These 2 algorithms
depend on certain assumptions about how the game is played ? elaborate they ?
Or
8.(a) Identify the classic parsing algorithms for parsing natural language.
(b) Make the augmented transition network for the subsequent sentence
'The dog likes a man' discuss steps.

Unit - V
9.(a) Would an expert system be a suitable technique for implementing an automate travel agent ?
(b) discuss how Bayesian Statistics provides reasoning under different types of uncertainty.
Or
10.(a) discuss the differences among the 3 mains styles of learning :
supervised, reinforcement and unsupervised.
(b) provide short definitions of the subsequent :
(i) Maximum Expected Utility
(ii) Intelligent Agent Architecture
(iii) Fuzzy control
(iv) Constraint
(v) issue Space(or Search Space)

Earning:   Approval pending.