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 best alternative in the following:                                         (2x10)

            a.     A formula expressed as disjunction of literals is called

(A)  Relation                                       (B)  Clause                                                           

              (C)  Well formed formula                    (D) Negation

            b.     __________ is a restricted form of learning in which one entity acquires knowledge without the help of a teacher.

(A) Perception                                    (B) Discovery

(C) Vision                                           (D) Knowledge acquisition directives.                   

            c.     Min-max procedure is a

(A) Depth-First process (B) Breadth-First process

(C) Learning process    (D) Understanding process

            d.     A function that maps from problem state descriptions to measures of desirability is known as

(A) Hash Function                  (B) Identity Function

(C) Heuristic Function            (D) Skolem Function

            e.     Boltzmann’s machine is a variation of _________ network                          

(A) Hopfield Network                  (B) ART Network

(C) Kohonen Network                           (D) SOM

            f.     _________ represents the kind of knowledge about events that is usually contained in natural languages sentences

(A) Frame                                           (B) Script

(C) Semantic Net                            (D) Conceptual Dependency

g.     Rule-based systems often contain rules with several conditions in their left sides.

(A) True                                             (B) False

h.     Fuzzy logic can be used to represent some kind of uncertain knowledge.

(A) True                                             (B) False

            i.      A learning program does not need to acquire new knowledge and new problem solving abilities.

(A) True                                                  (B) False

            j.      Natural language understanding problem can be described as a constant satisfaction problem.

(A) True                                             (B) False

Answer any FIVE Questions out of EIGHT Questions.

Each question carries 16 marks.

Q.2     a.   You are given two jugs, a 4-gallon one and a 3-gallon one. Neither has any measuring markers on it. There is a pump that can be used to fill jugs with water. How can you get exactly 2 gallons of water into 4-gallon jug? Define production rules for this problem and find the solution using these production rules.                                                                          (10)

             b.   Define a predicate ground (X) which succeeds if X is a ground term.                   (6)

Q.3     a.    What is Learning? Describe Rote learning and Learning by example.                   (8)

             b.   Describe Hopfield Networks. Give four features of a Hopfield network.              (8)

Q.4     a.   What is Planning? Explain Goal Stack planning with the help of an example.                        (8)

             b.   Describe Dempster-Shafer theory.                                                                     (8)

Q.5     a.   “Best First Search algorithm is not adequate for searching AND-OR graph” – Discuss with an example.                                                                (8)

             b.   How does iterative deepening improves the performance of A* search algorithm                 (8)

  Q.6     a.   Represent the following statements using conceptual dependencies

                   (i) Ramesh ate noddles with a fork.

                   (ii) Tom took the apple from John.

                   (iii) Mahesh is a teacher.                      (8)

             b.   Differentiate between Linear planning and Non-linear planning.                            (8)

Q.7     a.   Consider following PROLOG program:

grandfather(X,Y) :- father(X,Z), parent(Z,Y)

parent(X,Y) :- father(X,Y)

parent(X,Y) :- mother(X,Y)

father(James, Robert)

father(Mike, William)

father(William, James)

father(Robert, Hency)

father(Robert, Cris)  

                   Generate proof tree for following Goal

          ?- grandfather(William, X)                                                          (8)

             b.   Write a PROLOG program to compute Greatest Common Divisor (using Euclidean Algorithm). Generate search tree for the goal: ?-gcd(4,6,G).          (8)

Q.8     a.   Write a PROLOG program for merging two ordered lists X and Y.                    (8)

             b.   Show the validity of following sentences:

                   “All men are mortal. John is a man. Therefore John is mortal”                              (8)

  Q.9           Write short notes on                                                                                     (4 x 4)

                   (i) Definite Clause Grammar

                   (ii) Artificial Neural Networks

                   (iii) Transformation of a formula into Prenex Normal form

                   (iv) Heuristic Search