BTS(C) — VII ~ 06 — 045 (B) B. Tech Degree VH Semester Examination, November 2006 S702 ARTIFICIAL INTELLIGENCE (2002 Admissions Onwards) ‘Time : 3 Hours ‘Maximum Marks : 100 I. @)_—_ What are the components of a production system? @ (b) What are the requirements of a good control strategy? (4) (©) Explain any one hill climbing algorithm. © @® _—_ Explain the BFS algorithm. © OR U.— @)_State and explain the A” algorithm. (12) (®) Explain the DFS algorithm, What are its advantages over BFS? @) MI. (@)_—_Explain unification algorithm. @) (&) Explain forward chaining. @) (©) Explain the algorithm for resolution in predicate logic. (@) OR IV. @_Explain the algorithm to convert a given wif to clause form. Explain each step with an example. «ay (®) Consider the following facts: (Steve likes only easy courses Gi Science courses are hard Gi) All courses in the basket weaving department are easy (iv) BK 301 isa basket weaving course Use resolution to answer the question “What course would Steve like? © V. @_—_—_ Whatare the various steps in natural language understanding? (1g) ) ‘Write notes on oO ATN Gi) Top-down parsing (oy ‘OR vi. Write notes on: @ Lexical processing, © Gi) Semantic: grammars 6) Gil) Case grammars © iv) Bottom-up parsing @ VI. (@)_Differentiate between procedural and declarative representation of knowledge. ) (b) Explain with a neat diagram, the architecture of a rule based expert system, asy OR VIM. (@) Write notes on: (Bayesian networks Gi) Semantic nets 0) (&) Explain default logic and closed world assumption. 0) 1X. (@)_—_Whatis learning? Explain explanation based leaming, ao () List the primitive functions in LISP with examples. 0) oR X. @_—Writenotes on: @——Leaming by correcting mistakes 7 Gi) Leaming by recording cases ao (©) _Listthe features of prolog with examples. (10) are a