18CS71

Model Question Paper

Seventh Semester B.E. Degree Examination (2021-22)
ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
Time: 03 Hours Max Marks: 100
Note: Answer any FIVE full questions, choosing ONE question from each Module.

MODULE-1

1 a. Define Artificial Intelligence and list the task domains of Artificial Intelligence. (10 Marks)
b. State and explain 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
(i) Write down the production rules for the above problem
(ii) Write any one solution to the above problem (10 Marks)
b. Elaborate 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

(i) Man(Marcus)
(ii) Pompeian(Marcus)
(iii) ∀x: Pompeian(x) → Roman(x)
(iv) ruler(Caesar)
(v) ∀x: Roman(x) → loyalto(X. Caesar) V hate(x, Caesar)
(vi) ∀x :→y: loyalto(x,y)
(vii) ∀x :∀ y : man(x) ∧ ruler(y) ∧tryassassinate(x,y) → loyalto(x,y)
(viii) tryassassinate (Marcus, Caesar)
Convert these into clause form and prove that hate (marcus, Caesar) using resolution proof
(10 Marks)
OR
4 a. Recall Concept Learning and also Explain hypothesis space of Find-S
(05 Marks)
b. List out the steps of Candidate Elimination Algorithm. Apply the algorithm to obtain the final
version space for the training example

Ex. Sky Airtemp Humidity wind Water Forecast Enjoy

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

(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)

b. Summarize the appropriate problems for 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

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

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

(i) Entropy of the collection of transaction records of the table with respect to classification.
(ii)What is the information gain of A1 and A2 relative to the transactions of the table?

Instance. Classification A1 A2

1 + T T

2 + T T

3 - T F

4 + F F

5 - F T

6 - F T

(08 Marks)
b. Discuss the application of Neural Network which is used for learning to steer an autonomous
vehicle. (06 Marks)
 c. Write an algorithm for Back Propagation algorithm which uses stochastic gradient descent
method. (06 Marks)

MODULE-4
7. a. Illustrate Bayes Theorem and maximum posterior hypothesis (06 Marks)

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

Color Type Origin Stolen

Red Sports Domestic Yes

Red Sports Imported Yes

Red SUV Imported No

Yellow Sports Domestic No

Yellow SUV Imported Yes

Yellow Sports Domestic Yes

Red SUV Imported No

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

OR

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

b. Bring out the steps of 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)

OR
10 a. Discuss the learning tasks and Q learning in the context of reinforcement learning (10 Marks)
b. Apply K nearest neighbor classifier to predict the diabetic patient with the given features BMI,
Age. If the training examples are
 BMI Age Sugar

33.6 50 1

26.6 30 0

23.4 40 0

43.1 67 0

35.3 23 1

35.9 67 1

36.7 45 1

25.7 46 0

23.3 29 0
Assume K=3
31 56 1
Test Example

BMI=43.6, Age=40, Sugar=?

(10 Marks)
 GBGS SGHENME
USN
leleelelsl
Seventh Semester B.E. Degree Examination, Feb./Mar. 2022
18CS71

Artificial Intelligence and Machine Learning

Time: 3 hrs. Max. Marks: 100
Note: Answer any FIVE full questions, choosing ONEfull question from each module.

Module-1
List all task domains of Artificial
b. Inteligence. (06 Marks)
Explain Minimax procedure of tic tac-toe (07 Marks)
. LIst all
production rules for the water jug problem. (07 Marks)

2 a. OR
b. ustrate Slot and filler structure method in Question and Answering system. (06 Marks)
-

Ap lain Hill climbing issues which terminates algorithm without finding a goal state or
etting to a state from which no better state can be
C.
APply AO* algorithm for the generated. (04 Marks)
following graph and find final path. (10 Marks)

Fig. Q2(c)
5

3 a.
Convert the Module-2
) Marcus following
was a man
statement into its
Equivalent Predicate Logic from
iii) All Pompeians were i) Marcus was a
Romans Pompeian
iv) Caesar was a Ruler
v All Romans were either loyal to Caesar of hated him.
vi) Everyone is loyal to someone
vi) People only try to assassinate
vi) Marcus tried to assassinate rulers they are not loyal to.
b. List the issues on Caesar.
c. Knowledge
Construct maximally representation. (08 Marks)
specific hypothesis for the (05 Marks)
Example Sky Air Temp following training examples. (07 Marks)
Humidity Wind Water
Strong Warm Forecast
Sunny Warm Normal Enjoy Sport
Sunny Warm High Same Yes
Rainy Cold High Strong
Strong Warm
Same Yes
Sunny Warm Warm Change
High Strong | No
CoolChange Yes
4 a. OR
Apply Candidate Elimination algorithm for
vou classity following new the dataset
nstance from the set given above (Question 3(c)). How do
Elimination algorithm? of
hypothesis obtained by Candidate
InstanceSky Air Temp (12 Marks)
Humidity Wind Water Forecast Enjoy
Sunny
Fore
Warm Sport
B Rainy Cold NormalStrong
Normal|
Cool Change
High Warm Same
of 2
 18CS711

What are lon

Clauses? Wr ite a dec larative and a
proccdural representation.
dtlorenee between l ogie and PROLOG List syntactic
(08 Marks)

Construct decisuon tree

Modulc-3
using )3 algorithm for the following data 12 Marks)
Day Outlook Temp Humidity Wind Decisionn
SunnyHot
Iigh Wcak
Sunny Hot Yes
High Strong No
Overcast Hot High
Rain Mild
Wcak Yes
Rain
High Weak No
Cool Normal Weak
Derive Gradient descent rule. Yes
(08 Marks
6a. Give decision OR
tree to represent the following Boolean functions
i)
AABi)AV[BaC]ii) A XOR B
iv) [A B]
b.
Explain Perceptron [C D].
with
Perceptron. appropriate diagram Represent AND Boolean function
(08 Marks)
. Write Back using
propagation algorithm. (04 Marks)
(08 Marks)
a. A
patient takes a lab test and Module-
positive result in only 98% of thethecases
result comes
in
back positive. The test
returns a correct
negative result in only 97% of the cases in which the disease is actually present and correct
the entire which the disease is not a

b. population
Derive Brute force MAP
have the Cancer. Does a present. Further, 0.008 of
patient have Cancer or not?
learning and also mention (10 Marks)
assumption made in this
process.
(10 Marks)
8 OR
a.
Explain Minimum Description
b. Explain Naive Bayes classifier Length Principle (MDL)
and Bayesian belief
C. Write EM algorithm. Networks. (06 Marks)
(08 Marks)
(06 Marks)
9 a.
b.
Explain K NN algorithm.
-

Module-5
Explain steps of Locally Weighted Linear
c. Describe Radial basis fiunction with regression. (06 Marks)
appropriate diagram. (07 Marks)
(07 Marks)
10 a. Illustrate the basic concept ofQ- OR
b. Explain Q- Learning algorithm. learning using Simple Deterministic World. (10 Marks)
(10 Marks)

* * * *

2 of2