Cochin University of Science and Techology (CUST) 2011-5th Sem B.Tech Information Technology Special Supplementary 2012 - Question Paper

B.tech Degree V Semester Special Supplementary exam June 2011
IT505 KNOWLEDGE ENGINEERING
(2006 Scheme)
Time:3hrs Maximum Marks:100
PART A

(Answer ALL the questions)
(8*5)
I.(a)Explain the importance of knowledge representation in artificial intelligence.
(b)Write the unification Algorithm.
(c) State algorithm for Breadth 1st Search and Depth 1st Search.
(d) What do you mean by production system? Also discuss the characteristics of a production System.
(e) discuss data kinds used in LISP.
(f)Explain the syntax of conditional cond in LISP.
(g) discuss about supervised learning.
(h)Explain the important characteristics of Hopfield nets.

PART B
[4x15]
II.a) discuss how to prove theorems of predicate calculus by resolution by refutation. [10]
(b)Write notes on forward chaining and backward chaining.[5]
or
III.Describe the algorithm in detail to convert a wff into clausal form with the help of an example. [15]
IV.(a) Write difference ranging from Generate and Test and Hill Climbing searching strategies.[5]
(b) What is learning? define different methods of learning.[10]
Or
V. (a) define a-ß cut off for game playing. [7]
(b)Explain the levels of language used in NLP.[8]
VI.(a) discuss the basic functions and methods used in LISP.[10]
(b) Write a LISP function to obtain maximum of 3 numbers.[5]
Or
VII.(a) Write a LISP function to that return union of 2 simple list parameters that represents sets.[8]
(b) ) Write a LISP function that computes factorial of a provided number.[7]
VIII.(a)With suitable example s discuss Delta and Hebbian Learning rules.[10]
(b)Show how a single Mc –Cullosh Pitts neuron is used to implement a two input NOR gate.
OR
IX. discuss the training of BP network and also provide its derivation.[15]

Earning:   Approval pending.