CBGOISCHENE I L Ne 18CS71 Seventh Semester B.E. Degree Raaaggtion Jan./Feb. 2023 Artificial Intelligence and,Machine Learning Time: 3 bra. x, ¢ Wii. Marks: 100 Note: Answer any FIVE full questions, chod8ing ONE full question from each module. “ists 4 1 a The water jug problem states fare provided with tw6 jigs, one with 4 gallons of £ capacity and the other one with $egallons of capacity. Neithrhave any measuring markers a on it. How can we get exactly/t -ty6 gallons of water in 4 gallon jug? 2 @, Write down the proddggjon rules for the above q (i) Write any one soh the above problem. (* (08 Marks) g b. Explain Steepest Ascgit Hill Climbing technique with an algorithm. Comment on its = drawbacks and howfé,overcome these drawbacks: (02 Marks) : f ae ; 3 as ok) 2 a, Explain problem reduction with respect to )R graph with suitable example. (07 Marks) (07 Marks) a Whe glen, ce. Disc i constraint satisfactiot/@id solve the below. efit arithmetic problem, a ANGER ay ROSS + ROADS = D) (06 Marks) ? 4 Module-2 3 Consider the following senténces : . John likes all kindof food 1 2. Apples are food # 3. Chicken is 4, AnythingZanyéne eats and isn’t, 5. Bill cats peahuts and is still ali 6. Sue gats‘every everything Bill eais. a @T these sentences, las in prediéate logic. (05 Marks) Gi) Prove that John likes sing backward chaining, (05 Marks) Giant the fommulagghG)into clause (05 Marks) Se eae a= 2. Any revealing of idenifistion, appeal to evaluator and for equations written eg, 42:8 Important Note: 1. On completing your answers, compulsorily draw diagonal cross lines on the remaining blank pages Na : 4 a. Distinguish forwafthnd backward os with an example. (04 Marks) b. Find maximallySpecific hypot the training instances given below. Also write Find-S sat ‘The concept oP this particular problem will be on what days does a person lines to go on Walk. oe Time _| Weathefi].Temperature | Company | Humidity [ Wind | Goes Moming | Suniy,} Warm ‘Yes| Mild | Strong | Yes Evenine | Ray?” Cold No. Mild | Normal | “No ‘Moming | Siiny | Moderate [Yes | Normal |Nommal | Yes ‘Evening’|=-Sunny Cold Yes | High | Strong | Yes ” (08 Marks) €. Define version $face. Discuss the limitations of finds algorithm over candidate elimination algor cs (08 Marks) 1 of218CS71 Explain the concept of decision tree rane tea attribute selection measure used to 5a build the decision tree using D3 algorithm. (07 Marks) b, Howa single perceptron can be used to f the Boolean finctic ‘as AND, OR. 3 ? ¢ % (06 Maris) ©. Write Gradient Descent algorithm to aS ear unit along with the dBfivation. (07 Marks) LVyror 6 a. What do you mean by Gain 7? How it is used to Bild the decision tree. (08 Marks) b. Explain back propagation al ‘Why is it not likely tbe trapped in local minima? (08 Marks) ¢. Discuss the perceptron {Miping rule and delta rAQE solves the leaming problem of perceptron. S e (04 Marks) oS M i 7a. Explain Natve Hades classifier. ee, (08 Marks) b. ih Beli inal independence with example. (08 Marks) ©. ‘dangerous fires are rare?(1%) but smoke is fairly common (10% ¢ smokes. Findsibe probability of dangerous fire i . & (04 Marks) or && & 8 a. Discuss minimum deseri ath principle in Brief? © (08 Marks) b. Explain brute force ing algorithm, ° Y (08 Marks) emma 6 ca 9 a. Explain k-Neafestincighbor ‘ning (08 Marks) b. Explain Locally weighted regressio (OR Marks) What syeinforcement leaming (04 Marks) OC” FoR oy 10 a. Distinguish Eager lea zy leaming atin (o4 Marks) » de sor notes on O-gaing. | (08 Marks) Co ss about. Radialbasis fanction in (08 Marks) : CMRIT LIBRARY 2of2 ‘BANGALORE - 560087