# Solution to 18CS71 AIML Model Question Paper

• ## Computer Graphics OpenGL Mini Projects

### Solution to 18CS71 Artificial Intelligence and Machine Learning (AIML) Model Question Paper

MODULE-1

1. a. Define Artificial Intelligence and list the task domains of Artificial Intelligence. (10 Marks)

b. State and explain the algorithm for Best First Search Algorithm with an example.  (10 Marks)

### OR

2. a. A Water Jug Problem: You are given two jugs, a 4-gallon one and a 3-gallon one, a pump which has unlimited water which you can use to fill the jug, and the ground on which water may be poured. Neither jug has any measuring markings on it. How can you get exactly 2 gallons of water in the 4-gallon jug

• Write down the production rules for the above problem
• Write any one solution to the above problem                                      (10 Marks)

b. Elaborate on the steps of Simulated Annealing.                                                         (10 Marks)

## MODULE-2

3. a. Describe the issues of Knowledge Representation                                                (10 Marks)

b. Consider the following set of well-formed formulas in predicate logic

1. Man(Marcus)
2. Pompeian(Marcus)
3. ∀x: Pompeian(x) → Roman(x)
4. ruler(Caesar)
5. ∀x: Roman(x) → loyalto(X. Caesar) V hate(x, Caesar)
6. ∀x :→y: loyalto(x,y)
7. ∀x :∀ y : man(x) ∧ ruler(y) ∧ tryassassinate(x,y) → loyalto(x,y)
8. tryassassinate (Marcus, Caesar)

Convert these into clause form and prove that hate (Marcus, Caesar) using resolution proof (10 Marks)

### OR

b. List out the steps of the Candidate Elimination Algorithm. Apply the algorithm to obtain the final version space for the training example (10 Marks)

c. Compare the key differences between Find-S and Candidate Elimination Algorithm. (05 Marks)

### MODULE-3

5. a. Outline the ID3 Decision Tree Learning method.    (08 Marks) – v

b. Summarize the appropriate problems for the Decision Tree Learning method and also bring out the issues in decision tree learning.     (08 Marks)

c. Construct Decision trees to represent the following Boolean functions

A and B

A or [B and C]

[A and B] or [C and D]                                                                                         (04 Marks)

### OR

6. a. For the transactions shown in the table compute the following: – v

b. Discuss the application of Neural Network which is used for learning to steer an autonomous vehicle.  (06 Marks)

c. Write an algorithm for the Back Propagation algorithm which uses the stochastic gradient descent method.   (06 Marks)

## MODULE-4

7. a. Illustrate Bayes Theorem and maximum posterior hypothesis.  (06 Marks) – v

b. The following dataset gives information about stolen vehicles using Naïve Bayes classifier to classify the new data (Red, SUV, Domestic) (08 Marks) – v

c. Outline Brute force MAP Learning Algorithm.   (06 Marks)

### OR

8. a. Demonstrate the derivation of the K-Means Algorithm. (10 Marks)

b. Bring out the steps of the Gibbs Algorithm. (04 Marks)

c. Discuss the Minimum Description Length algorithm. (06 Marks)

## MODULE-5

9. a. With a neat sketch briefly explain Global Approximation of Radial basis Function. (10 Marks)

b. Derive the Gradient descent rule for a distance-weighted local linear approximation to the target function. (10 Marks) – v

### OR

10. a. Discuss the learning tasks and Q learning in the context of reinforcement learning    (10 Marks) – v

b. Apply K nearest neighbor classifier to predict the diabetic patient with the given features BMI, Age. If the training examples are

Assume K=3, Test Example is BMI=43.6, Age=40, Sugar=? (10 Marks)

Download the 2018 Scheme VTU CBCS Notes and Question Papers of 18CS71 Artificial Intelligence and Machine Learning

CSE VTU Question Papers

## 18CS71 Artificial Intelligence and Machine Learning Module wise Question Bank with Solutions

### Summary

Here you can find the Solution to the 18CS71 Artificial Intelligence and Machine Learning (AIML) Model Question Paper. If you like the material share it with your friends. Like the Facebook page for regular updates and YouTube channel for video tutorials.