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. An Expert system shell is a

(A)  Skeletal system.                            (B)  Programming language.

(C)   Domain specific shell.                   (D)  Knowledge representation

                                                             Technique.

b. Which of the following verbs can be represented as PTRANS using Schank’s CD representation

(A) tell                                                (B)  say

(C)  give                                              (D)  run

             c.   If a heuristic value _______ then A* guarantees an optimal solution  

(A) overestimate                                 (B)  Underestimate

(C)  Never overestimate                      (D)  Never underestimate

             d.   Goal Stack planning is  

(A)  Linear                                         (B)  Non-linear

             e.   ___________ is a linear separable problem.

(A) NOR                                           (B)  NAND

(C)  XOR (D)  OR

             f.    Candidate elimination Algorithm is used to __________ the version space.

(A) Narrow                                        (B)  Broaden

             g.   A reactive system selects an entire sequence before it does the first action.

(A) True                                             (B)  False

             h.   DAG cannot be used to represent causality relationships.

(A) True                                             (B)  False

             i.    Propose and revise systems builds up solution incrementally.

(A) True                                             (B)  False

             j.    Parsing using case grammar is not expectation driven.

(A) True                                             (B)  False

Answer any FIVE Questions out of EIGHT Questions.

Each question carries 16 marks.

Q.2     a.   Discuss the characteristics of a production system.                                              (6)

             b.   Trace the constraint satisfaction process solving the subtraction problem and what does 3651 stand for                                                                  (10)

                                 S    L    I     D   E

                           (–)        D   E    A   N  

                                       3    6    5    1

Q.3     a.   Explain MINIMAX procedure with Alpha-Beta cutoff and apply it to the given tree.                       (10)

      (7)     (6)           (8)     (5)        (2)     (3)         (0)     (-2)   (6)    (2)        (5)     (8)       (9)     (2)

b. Write a PROLOG program to search for an element in a Binary Search Tree.                    (6)

Q.4     a.   Write PROLOG program for Quick sort and Insertion sort.                              (10)

             b.   Compare the advantages and disadvantages of Depth First Search and Breadth First Search.                                                                     (6)

Q.5     a.   Write a recursive program in prolog to multiply the elements of integer list.           (8)

b.   Construct conceptual dependency for the following sentence                               (8)

                   (i)  Mary gave book to John.

                   (ii) While going to college, I saw a beggar.

Q.6     a.   Write about the architecture of Expert System with a neat diagram.                     (8)

             b.   Discuss briefly about 

                   (i) Natural language understanding   (ii)  Partitioned Semantic Net.                      (8)

Q.7     a.   Differentiate between the learning process of Hopfield networks and Kohonen’s Networks.                                                                       (10)

b. Explain the construction of Decision trees with suitable examples.                        (6)

  Q.8     a.  Explain the process of solving the blocks world problem using non-linear planning.               (10)

             b.   Discuss about different components of a planning System                                    (6)

Q.9     a.   Write short note on Bayesian net Probable reasoning.                                         (4)

             b.   Let  T and F be two fuzzy sets of TALL & FAT persons respectively. If the member grade of a person P being T is 0.7 & being F is 0.6, then find member grade of P being                                    

                   (i) TALL and FAT                               (ii) TALL or FAT                                   (4)

c. Obtain the case grammar for the sentence

                            I want to print Ananya’s .exe file.                                                              (8)