Assignment 1
1. Design a learning program to learn to play checkers, with goal of entering into the
world checkers tournament.
2. Explain the how FIND-S algorithm is used in more-general-than partial ordering with
an example.
3. Write the final version space for the below-mentioned training examples using the
candidate elimination algorithm.
Exampl Edition
e Citations Size InLibrary Price s Buy
1 Some Small No Affordable One No
2 Many Big No Expensive Many Yes
3 Many Medium No Expensive Few Yes
4 Many Small No Affordable Many Yes
4. Explain the Candidate elimination algorithm.
5. What are appropriate problems for Decision tree learning?
6. Discuss about the statistical measures used in ID3 algorithm for decision tree
learning.
7. Give Decision trees to represent the Boolean Functions:
1. A && ~ B
2. A V [B && C]
3. A XOR B
4. [A&&B] V [C&&D]
8. Identify the entropy, information gain and draw the decision trees for the following
set of training examples
Gender Car ownership Travel cost Income Level Transportation (Class)
Male Zero Cheap Low Bus
Male One Cheap Medium Bus
Female One Cheap Medium Train
Female Zero Cheap Low Bus
Male One Cheap Medium Bus
Male Zero Standard Medium Train
Female One Standard Medium Train
Female One Expensive High Car
Male Two Expensive Medium Car
Female Two Expensive High Car
9. Write a note on (i) Perceptron Training Rule (ii) Gradient Descent and Delta Rule
10. Write Gradient Descent algorithm for training a linear unit.
11. Derive the Gradient Descent Rule