Sei sulla pagina 1di 3
Question Paper Code : 10274 B.EVB.Tech. DEGREE EXAMINATION, MAY/JUNH 2012. Sixth Semester Computer Science and Engineering 08 2951/08 61/1014 CS 601 — ARTIFICIAL INTELLIGENC> (Common to Seventh Semester Electronics and Instrumentatien Wnginee: sig) (Regulation 2008) ‘Time : Three hours Maximum : 100 marks Answer ALL questions PART A — (10 x & — 28 mnarlc 1. Define absteavtivn 2, State the eonecopt of rationals Define Diagnostic rules with example. 4 Stato the nse of unification Define centingency planning. 6, What is the function of hierarchical task network planning? 7 Define prior probability. S. State the types of approximation methods. Define reinforcement learning. 10 Define Ockham’s razor. u 12. 13. (a) o (a) b) (a) ) fe wy o aa PART B— ( = 16= 80 marks) Is Al a science or is it engineering? Or neither or both? Explain. (8) Explain the goal and model based roflex agents with example. (8) Or Describe a state space in which iterative deepening search periernas much worse than depth-first search. 4) Prove that the breadth first search is a special case of umiiorm cost search. ® Explain the forward chaining process in dviail si[h e

Potrebbero piacerti anche