Scribd
Upload
48 views

February March 2022

The document is an exam for a Machine Learning course. It contains 8 questions about various machine learning algorithms and concepts: 1. Question 1 asks about decision tree learning algorithms and the need for inductive bias. 2. Question 2 explains the Find-S algorithm for finding specific hypotheses and issues in decision tree learning. 3. Question 3 covers backpropagation for feedforward neural networks and estimating hypothesis accuracy.

Uploaded by

Yash Gandharv
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
48 views

February March 2022

The document is an exam for a Machine Learning course. It contains 8 questions about various machine learning algorithms and concepts: 1. Question 1 asks about decision tree learning algorithms and the need for inductive bias. 2. Question 2 explains the Find-S algorithm for finding specific hypotheses and issues in decision tree learning. 3. Question 3 covers backpropagation for feedforward neural networks and estimating hypothesis accuracy.

Uploaded by

Yash Gandharv
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Code No: 156BN R18

us
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
B. Tech III Year II Semester Examinations, February/March - 2022
MACHINE LEARNING
ed
(Computer science and Engineering)
Time: 3 Hours Max. Marks: 75
Answer any five questions
All questions carry equal marks
---
pa
1.a) Discuss about the basic Decision Tree Learning algorithm.
b) Briefly explain the need of Inductive Bias in decision Tree Learning. [7+8]
pe
2.a) Explain the Find-S: Finding a Maximally Specific Hypothesis in detail.
b) Explain the issues in decision tree learning. [10+5]
rf
3.a) Present the Backpropagation algorithm for feedforward networks and explain each step
in it.
eb
b) Explain how to estimate hypothesis accuracy. [9+6]

4.a) Define the terms estimation bias and confidence intervals.


b) Discuss the central limit theorem for deriving confidence intervals in detail.
/m
c) Explain the representation of neural networks. [5+5+5]

5.a) Design the Brute Force Bayesian concept learning algorithm and elaborate.
ar
b) Explain the Mistake Bound for the Halving Algorithm. [8+7]

6.a) Explain the Maximum Likelihood Hypotheses for predicting probabilities.


-2
b) Elaborate the Locally Weighted Linear Regression. [8+7]
0
7.a) Explain the Q–learning with suitable example.
b) Explain about the hypothesis space search. [8+7]
22
8.a) Discuss about the Explanation-based Learning of Search Control Knowledge.
b) Explain how to initialize the hypothesis by using prior knowledge. [8+7]
jn
---ooOoo---
tu
h

You might also like