Sei sulla pagina 1di 2
Question Paper Code: 11282 BE/B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2012. Sixth Someater Computer Science and Engineering GS 2351/08 61/101 44 CS 601 _ ARTIFICIAL INTELLIGENCE (Common to Seventh Semester — Electronics and Instrumentation Fingineering) (Regulation 2008) ‘Time : Three hours Maximum : 100 mars Anawer ALL questions. PART A — (10x 2 = 20 marks) 1, What are the functionalities of an agent function’? 2, How can we avoid ridge and platens in bill climbing? 8. Represent the following sentence in predicate form “All the children likes aweets.” 4. What is tfie significance in using the unification algorithm? Distingnish between problem solving and planning. e 6 What age the characteristics of partial order planer? Define the Dayes rule, 8. What do you'mean hybrid Bayesian network? Distinguish between supervised learning and reinforcement learning. 10. Define computational learning theory. ll. 12, 13, 1M 15, (a) ) (a) ) @) ) (a) ) (a) PART B—( x 16= 80 marks) Explain in detail, tho structure of different intelligent agents. (16) Or Explain AO* algorithm with an example, (16) Consider the following facts and represent them in predicate form FL. There are 500 employees in A BC company F2. Employees earning more than Rs.5000 pay tax F3, John is a manager in ARC company Ta, Munager earns Ks, 10,000, Convert the facts in predicate form to clauses and then prove by resolution : “John pays tax”, Or Explain with an example the use of unifieation algorithm to prove the concent of resolution. 16) Explain the coneopt behind partisl order planning with suitable examples. (16) Ow Explain the use of planning graphs in providing better heuristic estimates with suitable examples. (16) Explain the inothod of performing exact inferonee in Buyusinn Networks. a6) Or oxplain the concept of inference in temporal models. a6) Explain the concept of learning using Decision trees. (a6) or Write chort notes on + (i) Reinforcement learning ® Gi) Explanation based learning. ® 2 11282

Potrebbero piacerti anche