AMIETE – CS/IT
(OLD SCHEME)
Code: AC20/AT21 Subject:
ARTIFICIAL INTELLIGENCE &
NEURAL
NETWORKS
Time:
3 Hours
Max. Marks: 100
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 else.
· Out of the
remaining EIGHT Questions, answer any FIVE Questions. Each question carries 16
marks.
· Any required data
not explicitly given, may be suitably assumed and stated.
Q.1 Choose the correct or the best alternative in the following: (2
10)
a.
Which of the following does not belong to the scope of AI?
(A)
Robotics. (B)
Theorem Proving.
(C) Encryption. (D) Natural Language Processing.
b. Reasoning from a goal state towards an initial
state is called ________________.
(A)
Forward Chaining. (B) Backward Chaining.
(C) Breadth First Search. (D)
Hill Climbing Technique.
c. Which
of the following verbs can be represented by MTRANS in Schank’s CD formalism?
(A)
push (B) eat
(C) give (D) speak
d. The
process of making two or more expressions in logic equivalent is called
(A)
resolution. (B) deduction.
(C) unification. (D)
conversion.
e. V
x: € y Q(x, y) -------> P(x) in PROLOG can be represented as: -
(A)
P(x):- Q(x, y) (B) Q(x, y):- P(x)
(C) Both A and B (D) None of the above
f. If
a heuristic value _________________ then A* guarantees an optimal solution.
(A)
Overestimates. (B)
Never overestimates.
(C) Underestimates. (D)
Never Underestimates.
g. Goal
stack planning is
(A)
Linear. (B) Non-Linear.
(C) Both (A) and (B). (D) None of the above.
h. A
_________ represents information as a set of nodes connected to each other by a
set of labeled arcs.
(A)
Script. (B) Frame.
(C) Conceptual
Dependency. (D)
Semantic Nets.
i. Which
of the following cannot be learnt by a perception (x, y are inputs and z is
output)?
(A)
(B)
(C) (D)
j. Analyzing words into their components and
non-word tokens is called
(A)
Pragmatic Analysis. (B) Semantic analysis.
(C)
Morphological Analysis. (D) Syntactic analysis.
Answer any FIVE Questions out of EIGHT Questions.
Each question carries 16 marks.
Q.2 a. Explain Breadth-First Search Algorithm with the help of an
example. Write advantages and disadvantages of the same, with respect to Depth
First search. (8)
b. Discuss the Hill Climbing Technique. What types of problems arise
in Hill Climbing Search and how will you overcome these problems? (8)
Q.3 a. Explain the MINIMAX procedure and apply it to given tree. (10)
(7) (6) (8) (5) (2) (3) (0) (-2) (6)
(2) (5) (8) (9) (2)
b.
Translate the following sentences into
first order logic. (6)
(i)
John
likes all kinds of food.
(ii)
Apples are food.
(iii) Anything anyone eats and is not killed by is
food.
(iv) Chicken is food.
(v)
Bill eats peanuts and is still
alive.
(vi) Sue eats everything Bill eats.
Q.4 a.
Write short notes on the following: -
(8)
(i )
Semantic Networks
(ii)
Conceptual Dependency
b. Write
a PROLOG segment which counts the number of positive integers given an
arbitrary list of integers. (8)
Q.5 a. Explain A* search technique briefly. Why is it better than depth
first search technique? Under what
condition does A* generate optimal solution? (10)
b. Discuss briefly about Hopfield Network
with the help of an example. (6)
Q.6 a. Explain the architecture of an Expert System with the help of a
neat diagram. What points should be considered when designing an expert system. (8)
b. Show how Bayes theorem is used to evaluate the probability that a
Hypothesis 
(given i = 1, m) is true given
the evidence E. (8)
Q.7 a. Show how a perception can be trained to learn the following input
output pairs. (8)
|
A |
B |
Output |
|
0 |
0 |
0 |
|
0 |
1 |
0 |
|
1 |
0 |
0 |
|
1 |
1 |
1 |
b.
Give a parse tree for the sentence
“Bill printed the file” where the following rules are used. (8)
S → NP VP
NP→
PN
NP→DET N
VP→
V NP
N→
file
PN→
Bill
DET→
The
V→ printed
Q.8 a. Write and explain the components of a Planning System. (6)
b. Illustrate with an example the concept of ATN in Natural
language processing. (6)
c. Construct a semantic net representation for
the following :- (4)
(i) Sita and Gita are children of Mala. Sita is
fair and Gita is dark.
(ii)
Pompeian (Marcus), Blacksmith (Marcus).
Q.9 a. Explain any of the following expert system R1 (XCON) or MYCIN. (8)
b. Discuss
briefly about: (4)
(i)
Top down Parsing
(ii)
Bottom up Parsing
c.
Let I and H be two fuzzy sets of
INTELLIGENT and HANDSOME persons respectively. If the member grade of a person
P being I is 0.35 and being H is 0.6, then find member grade of P being (4)
(i) INTELLIGENT and HANDSOME
(ii) INTELLIGENT or HANDSOME