Reg. No.

B.E. DEGREE MODEL EXAMINATION, APRIL 2013

DATE : 15.04.2013

Sixth Semester
Computer Science and Engineering
CS2351 ARTIFICIAL INTELLIGENCE
Time : Three hours

Maximum : 100 marks

Answer ALL questions
Part A - (10 x 2 = 20)

1. Mention the characteristics of intelligent agent.

2. State the significance of using heuristic function.
3. What factors justify whether reasoning is to be done with forward or backward reasoning.
4. Represent the following sentence in predicate form.
All children like sweets
5. Difference between state space search and plan space search.
6. What are the characteristics of partial order planner?
7. List any two examples of Hidden Markov Model.
8. Define Dempster-Shafer theory.
9. State Ockhams Razors Principle.
10. Write any four limitations of Neural network.
Part B - (5 x 16 = 80)
11(a) (i) Discuss the following types of agent programs.

(8)

Model based Agents

Learning Agents
(ii) Explain the following uninformed search strategies.

(8)

Iterative deepening depth-first search.

Bidirectional search.
Or
(b)Formulate 8-Queens using incremental formulation and 8-puzzle problem using standard
formulation

(16)

12 (a) Explain with an example the use of unification algorithm and its usage.

(16)

Or
(b) Explain about the forward and backward chaining algorithm with example.

(16)

13(a)(i) Explain Partial Order planning with neat example.

(ii) Explain the concept of planning with state space search.

(10)
(6)

Or
(b)(i) Explain the use of planning graphs in proving better heuristics estimates with suitable
examples.

(16)

14.(a)(i)Explain the exact inferences of Bayesian Networks with examples.

(ii) Explain the concept of Temporal models.

(10)
(6)

Or
(b)(i)What is Hidden Markov Model ? Explain the concepts of HMM.

(8)

(ii)Explain about how EM algorithm can be used for learning of hidden variables .
(8)
15.(a) (i) Explain about statistical learning methods.
(ii) Explain about Explanation Based Learning.

(8)
(8)

Or
(b) What is Reinforcement Learning? Explain about active and passive reinforcement learning.
(16)