1.
Distinguish between supervised learning, Unsupervised learning and
Reinforcement learning. Illustrate with an example
2. Discuss any four examples of machine learning applications.
3. Give decision trees to represent the following Boolean functions
a. A ˄˜B
b. A V [B ˄ C]
c. A XOR B
d. [A ˄ B] v [C ˄ D]
4. Define the terms Hypothesis space and Version space. Illustrate with an
example
5. Contrast the hypothesis space search in ID3 and candidate elimination
algorithm
6. Illustrate the impact of overfitting in a typical application of decision tree
learning
7. What is the difference between Find-S and Candidate Elimination Algorithm?
8. Define the following terms:
LMS weight update rule
Consistent Hypothesis
General Boundary
Specific Boundary
1. What is a Perceptron? Explain the working of a perceptron with a neat
diagram
2. Distinguish between inductive bias and estimation bias.
3. Discuss how a multi-layer network learns using a gradient descent algorithm.
4. What is Artificial Neural Network. Discuss the Perceptron training rule.
5. Derive the Gradient Descent Rule.
6. Derive the Backpropagation rule considering the training rule for Output Unit
weights and Training Rule for Hidden Unit weights
7. Discuss the Perceptron training rule. Under what conditions the perceptron
rule fails and it becomes necessary to apply the delta rule?