Download AKTU B-Tech 7th Sem 2016-2017 NCS 702 Artificial Intelligence Question Paper

Download AKTU (Dr. A.P.J. Abdul Kalam Technical University (AKTU), formerly Uttar Pradesh Technical University (UPTU) B-Tech 7th Semester (Seventh Semester) 2016-2017 NCS 702 Artificial Intelligence Question Paper

Printed Pages: 4 NCS-702
(Following Paper ID and Roll No. to be ?lled in your
Pauper ll) : 2289928 Roll No.
Answer Books)
B.TECH
Regular Theory Examination, (Odd Sem - VII) 2016-17
ARTIFICIAL INTELLIGENCE
Time : 3 Hours Max. Marks : 100
Section - A
1. Attempt all parts of the following. All parts carry
equal marks. _ (10X2=20)
a) State the signi?cance of using heuristic functions?
b) Distinguish between state space search and plan
space search.
c) List two applications of Hidden Markov model.
d) List various criterions for success in Al.
e) I What is semantic analysis? Explain. ,
f) List various issues in knowledge representation.
g) What do you mean by local maxima with respect to
search technique?
702/12/2016/13540 (1) [P.T.O.

h)
j);
NCS-702
List down two applications of temporal probabilistic
models. '
What are the limitations in using propositional logic
to represent the knowledge base?
De?ne reinforcement learning.
Section - B
2. Attempt any 5 questions from this Section. (5X10=50)
a) Explain AO* algorithm With a suitable example.
State the limitations in the algorithm.
b) Explain the constraint satisfaction procedure to
solve the crypt arithmetic problem.
CROSS + ROADS = DANGER.
c) What are planning graphs? Explain the methods of
planning and acting in the real world.
d) What is resolution? Discuss the role of resolution
in predicate logic.
e) What are various production system characteristics?
' Discuss the various issues involved in the design of
seaIch programs.
702/12/2016/13450 (2)
g)
'h)
Attempt any 2 of the following.
3. a)
b)
b)
NCS-702
Explain in detail on the characteristics and
applications of learning agents.
Explain uni?cation algorithm used for reasoning
under predicate logic with an example.
Explain the method of handling approximate
inference in Bayesian Networks.
Section - C
(2XI5=30)
Explain the use of Hidden Markov Models in
Speech Recognition.
Discuss various approaches in NLP.
What is problem space? How problem can be
de?ned as state space search?
Explain Min-Max algorithm with example.
What are the heuristic search techniques in A1?
Explain any one in detail.
Write short note on Conceptual Dependency.
What do you mean by representing instance and ISA
relationship?
Elaborate Forward and Backward chaining.
702/ l 2/2016/13540 (3) [P.T.O.

NCS-702
0) Consider the problem of learning to play tennis. Are
there aspects of this learning that are supervised
learning? Is this supervised learning or
reinforcement learning.
++++
702/12/2016/13540 (4)