MODULE 2

1. Write the algorithm for conversion to clause forms.

2. Explain forward versus backward reasoning with examples and list the factors that
influences the choice between them
3. Consider the following sentences:
 John likes all kinds of food.
 Apples are food
 Anything anyone eats and isn’t killed by is food
 Bill eats peanuts and is still alive
 Sue eats everything Bill eats
i) Translate all the sentences into formulas in predicate logic
ii) Convert formulas from previous step into clause form
iii) Prove that John likes peanuts using resolution
4. Define CNF. Give an algorithm for converting given proprosions to CNF
5. State and explain the algorithm to convert predicates to clause form
6. Write a candidate elimination algorithm. Apply the algorithm to obtain the final version
space for the training example.

SL. Sky Air temp Humidity Wind Water Forecast Enjoy

NO. Sport
1 Sunny Warm Normal Strong Warm Same Yes
2 Sunny Warm High Strong Warm Same Yes
3 Rainy Cold High Strong Warm Change No
4 Sunny Warm High Strong Cool Change Yes

MODULE 3
1. Define perceptron. Explain the concept of single perceptron with neat diagram
2. What is gradient descent and delta rule? Why stochastic approximation to gradient
descent is needed?
3. Derive the back propagation rule considering the output layer and training rule for
output unit weights
4. Describe ID3 algorithm for decision tree learing.
5. Apply ID3 algorithm for constructing decision tree for the following training example

Day Outlook Temperature Humidity Wind Play Tennis

D1 Sunny Hot High Weak No
D2 Sunny Hot High Strong No
D3 Overcast Hot High Weak Yes
D4 Rain Mild High Weak Yes
D5 Rain Cool Normal Weak Yes
D6 Rain Cool Normal Strong No
D7 Overcast Cool Normal Strong Yes
D8 Sunny Mild High Weak No
D9 Sunny Cool Normal Weak Yes
D10 Rain Mild Normal Weak Yes
D11 Sunny Mild Normal Strong Yes
D12 Overcast Mild High Strong Yes
D13 Overcast Hot Normal Weak Yes
D14 Rain Mild High Strong No

6. Explain appropriate problems for Neural network learning with its characteristics
7. Explain back propagation algorithm

MODULE 4
1. What is bayes theorem and maximum posterior hypothesis?
2. Derive an eqation for MAP hypothesis using Bayes theorem