ARTIFICIAL INTELLIGENCE 2018 MCA 4th Sem AKTU

Printed Pages: 1 Sub Code: RCA403

Paper Id: 214431 Roll No. _____________________

MCA

(SEM IV) THEORY EXAMINATION 2017-18

ARTIFICIAL INTELLIGENCE

Time: 3 Hours Total Marks: 70

Note: Attempt all Sections. If require any missing data; then choose suitably.

SECTION A

1. Attempt all questions in brief. 2 x 7 = 14

  1. What is meant by the term artificial intelligene? How it is different from natural intelligence?
  2. Discuss branch and bound search algorithms.
  3. Differentiate between locl search and global search.
  4. Transform the following formulla to Prenex normal form:
  5. \forall x \colon \forall y \colon \left(\exists z \colon P \left( x, z\right) \cap P \left( y, z\right) \right) \longrightarrow \exists u \colon Q \left( x, y, u\right)
  6. Define forward chaning and backward chaining with example.
  7. Explain in brief the concept of reinforcement learning.
  8. Write a short note on support vector machines.

SECTION B

2. Attempt any three of the folloing: 7 x 3 = 21

  1. What is an intelligent agent? Discuss any two types of intelligent agents.
  2. Explain steepest-ascent hill climbing algorithm. What are the problems with hill climbing algorithm?
  3. Describe Hidden Markov Model with suitable example. Also discuss its role in probabilistic reasoning.
  4. Discuss Maximum-likelihood parameter learning for complete data with discrete models.
  5. What do you mean by classification? Discuss the process of classification with the help of a diagram.

SECTION C

3. Attempt any one part of the folloing: 7 x 1 = 7

  1. Discuss the historical development of artificial intelligence.
  2. For each of the following agents, develop a PEAS description of the task environment:
    1. Mathematician’s theorem proving assistant
    2. Satellite image analysis system
    3. Internet book shopping agent
    4. Medical diagnosis system

4. Attempt any one part of the folloing: 7 x 1 = 7

  1. Discuss simulated annealing search algorithm with its advantages and disadvantages.
  2. What are the steps to define a problem? Explain. Also discuss various components of a problem.

5. Attempt any one part of the folloing: 7 x 1 = 7

  1. Discuss algorithm of conversion to clause form Convert the following to clause form using algorithm: \forall x \left[ Brick \left(x\right) \longrightarrow \left(\exists y \left[ On \left( x, y\right) \cap \neg Pyramid \left(y\right)\right] \cap \neg \exists y \left[ On \left( x, y\right) \cap On \left(y, x\right)\right] \cap \forall y \left[ \neg Brick \left(y\right) \longrightarrow \neg Equal \left( x, y\right)\right]\right)\right]
  2. Explain the concept of Alpha beta pruning. Write alpha beta search algorithm. 

6. Attempt any one part of the folloing: 7 x 1 = 7

  1. Discuss various application domains of machine learning.
  2. Descibe major step involved in a learning process. Also discuss how learning systems are classified.

7. Attempt any one part of the folloing: 7 x 1 = 7

  1. What is pattern recognition? Explain various steps involved in the designing of a pattern recognition system with the help of a diagram.
  2. Explain nearest neighbour rule used for classification.

Lokesh Kumar

Being EASTER SCIENCE's founder, Lokesh Kumar wants to share his knowledge and ideas. His motive is "We assist you to choose the best", He believes in different thinking.

Leave a Reply

This site uses Akismet to reduce spam. Learn how your comment data is processed.