Subject: ARTIFICIAL INTELLIGENCE & NEURAL
Time: 3 Hours
NOTE: There are 9 Questions in all.
Question 1 is compulsory and carries 20 marks. Answer to Q. 1. must be
written in the space provided for it in the answer book supplied and nowhere
Out of the remaining EIGHT Questions answer any FIVE Questions. Each
question carries 16
Any required data not explicitly given, may be suitably assumed and stated.
Choose the correct or best alternative in the
Which of the following ver
bs can be represented as MTRANS using
Schank’s CD representation
Non monotonic reasoning
an always growing fact base
none of the above
In the alpha
beta minimax search, alpha is _____________ on the values that
_________ node maybe ultimately assigned.
a lower bound, maximizing
an upper bound, minimizing
a lower bound, minimizing
an upper bound, maximizing
In connectionism, _____________ is a search technique and the learning
techniques are _______________ and ___________.
el relaxation, version spaces, A*.
Parallel relaxation, explanation
based learning, and discovery.
Parallel relaxation, backpropogation, reinforcement learning.
Parallel relaxation, hill climbing, reinforcement learning.
The ID3 algorithm constructs decision trees by choosing
Attributes that will yield more information
Attributes that will yield less information
Attributes that will
ld any information
None of the above
Generalisation hierarchy does not support property inheritance
Resolution works on statements that ar
e in single canonical form
Natural deduction doesn’t use human theorem proving
Unification is a process to represent substitutions during pattern matching
Bayesian networks uses more of local representation which describe clusters
Answer any FIVE Questions out of EIGHT Questions.
Each question carries 16 marks.
Discuss the significance of State space search in solving an AI
What are the various search strategies known? Differentiate among
Symbolize and validate the following argument.
ens pay their taxes.
Mr. Shyam pays his taxes.
Therefore, Mr. Shyam is a law
Differentiate between AO* and A*
Let STACK(X,Y) and PICKUP(X) be two of the operators for
manipulating blocks on a table using one arm of
a robot. Formulate the
precondition, delete and add lists for these operators. Thes
e operators are
to be used by a simple planner using a goal stack.
Suppose the goal to be achieved is ON(C,A) and ONTABLE(A) from the
initial state ONTABLE(A) and ONTABLE(C). Explain the details of plan
generation where the plan is PICKU
P(C) followed by
cut off and Beta
cut off with
Discuss the various problems being faced by Expert
Consider the following set of propositions
patient has spots
patient has measles
patient has high fever
patient has been inoculated against measles
patient has an allergy
(i) Create a network that defines the casual connections among these
(ii) Make a Bayesian network by constructing the necessary conditional
Describe in general , claus
es, facts, goals and rules of PROLOG. Elaborate
them with respect to the knowledge given below.
“A house has a roof, a door and a window. A door has a knob. If an
entity is a house, then it has a door. My house is
Write a PROLOG program to find the maximum number from a given list
Describe the candidate elimination algorithm in narrowing the version
space using an
Explain the various components of a planning
Write short notes on
Non Monotonic Reasoning
Characteristics of a production system
Activation functions of a Neuron.
Consider the following sentence
John punched Bill.
Show how it would be represen
ted in case grammar.
Show how it would be represented using conceptual dependency
Discuss the advantages and disadvantages of these
Describe the different strategies that
can be used for knowledge