Code No: 1SSBZ [Ris ] JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B. Tech III Year I Semester Examinations, March -. 2024 —~ MACHINE:LEARNING | “ i (Computer Science and Engincering - Artificial Inteligence and Machine Learning) |_| ~ Time: 3 Hours “Max. Marks: 78 Note: ‘Question paper consists of Part A, Part B. ) Part A is compulsory, which carries 25 marks. In Part A, Answer all questions. ill) In Part B, Answer any one question from each unit. Each question carries 10 marks S and may have a, bas sub questions. -—. ID LAG \ UG DN Gates US es 25 Maris) 1.a) List out the issues in Machine Learning. P] b) Define Well-Posed problem leaning problem. Give an example. B) ©), What are Sample Error and True Error? ~ 2) 4) List out 3 characterstes ofthe problems for which ANN Teining technigue is suitabte.| “> VIN Go OI Bh \ ©) What is Minimum Description Length Principle? 2 1) Write the remarks on k-NEAREST NEIGHBOR Algorithm. GB] 8) What are First-Order rules? 2 h) Discuss about Resolution Rule for automated deduction, BI i) What is the primary goal of Analytical Leaning? 2] SD Write die uifferénces between FOIL and FOCL. | YO BLD a Caw 7 (50 Marks) 2a) Write about Find-S algorithm. ») Consider the following data set having the data about which particular seeds are ous. Find out the Maximaly Specific Hypothesis using Find-S algorithm. (446) ~ “fiEximpte [Color _]Tougtiness [Fungus [Appearance [Poisonous] 7 \~ : GREEN [HARD [NO | WRINKLED| YES GREEN [HARD | YES [SMOOTH _[NO_ BROWN | SOFT | NO | WRINKLED | NO. ORANGE | HARD [NO | WRINKLED | YES GREEN] SOFT /YES | SMOOTH [YES _—~ GREEN | HARD {| YES | WRINKLED | Yes. \ ORANGE | HARD~*_['NO /WRINKLED [ YES_“=7 Vs OR 3.a) Write the steps in building Decision Tree using Information Gain. 'b) What are the hyper parameters of decision tree? 793) La Ia ia Lia bin , UN UR UI VW UXHow do Artificial Neural Networks work? Explain [Write the’ advantages 4 of Antificial Nedal dele X. } Sod _/ \ at Wite\ the ‘procedure for ‘Comparing two cing methods,” Explain Estimators, Bias, and Variance, [545] Explain Naive Bayes algorithm with an example. Write about oS Algorithm. [6+4) a poms 1 ORS Va (Whatlis Leaming with Radial Basis Functions? Explain, LK EG ‘Explain Locally Wefghted Linear Regression. 2 Sef Se ESS OS 8.a) Define Genetic Algorithms. Explain the basic components of a typical Genetic Algorithm. b) What is the hypotesi space in the context of Genetic Algorithms? [5+5] = OR, . = _ [Destribe the Q-learning algorithin ang fis key componeris.» |_| t | ~ ‘Define. dynamic } programming and.its ‘relevance to reinforcement Ieamnibg 4 [73Y 10. Explain EBNN algorithm in detail. (10) Ila) What is Explanation-Based Learning (EBL) and how does it contribute to Analytical Learning? b) {Diséuss the relationship between ‘EBL afid the extraction ‘of general knowledge. [6+4]] ( Lo JD, UR I UR ok —00000--- yom Le \ Lam if iat \ JY WW WS Ce, uo | | cs { | ae | | o | Va Li VS we Nd ef 4 ee,