Save trees use e-Question Paper Go green DOWNLOAD THIS FREE AT www.vturesource.com wx TT LITT oer sTeA/6c: Seventh Semester B.E. Degree Examination, Dec.09/Jan.1 Time: 3 hrs. Marig:100 Note: Answer any FIVE full questions, selecting at least TWO questions from each part. 2 i PART-A 2 1 a. Withexamples, explain different types of task environments. (12 Marks), 8. Explain Bresdth-Fist-Search (BFS) stateny (ot Mari) 2 a. Explain A* search strategy. Prove i i é an pages bb. Write the algorithm for online search agent that first exploration. (08 Marks) ? 38 togie (10 Marks) Hn b, Write the algorithm for Wumpos - we 1 WWE pits, wupuses and safe squares if GO Marks u £3 4 a Wrte me max of nt onder fag BRE oman) qj i. Listand explain the steps inv ledge engineering projects. (10 Marks) Be 2 PART_B EE Sa. Write toward chainifie a Mars) E : . Explain aspects ofjpiplog outside standard logical inference ars) Hi 6 a. Explain with & first order logic expresses facts about categories. (10 Marks) 5 Explain thiiggtology pPsituation calculus (0 Maris) fF 2 | IPS and ADL programming languages represent planning problems. ge (Go starts) oS b. dithst Myavesian newwork? Explain how itis used to represent knowledge? 10ers) 8 Q. weite the decision tree learning algorithm. (0 Mares) Exon how the applicability of decision tres i broadened tomar BRANCHES | ALL SEMESTERS | NOTES | QUESTON PAPERS | LAB MANUALS A Vturesource Go Green initiative