USN IS622T3I
Sixth Semester B.E. Degree Examination, Jun/Jul 2025
ARTIFICIAL INTELLIGENCE & MACHINE LEARNING
(MODEL QUESTION PAPER)
Time: 3 hrs. Max. Marks: 100
Note: Answer any FIVE full questions, choosing ONE full question from each module.
Q. No. Questions Marks BL/CO
Module I
1 a. Define Artificial Intelligence and list the task domains of Artificial Intelligence. 6 CL2/CO1
b. Illustrate the problem characteristics in detail. 6 CL3/CO1
c. Three missionaries and three cannibals want to cross a river. There is a boat on 8 CL3/CO1
their side of the river that can be used by either one or two persons. How should
they use this boat to cross the river in such a way that cannibals never
outnumber missionaries on either side of the river? If the cannibals ever
outnumber the missionaries (on either bank) then the missionaries will be eaten.
How can they all cross over without anyone being eaten? Demonstrate the
solution with Production rules.
OR
a. A Water Jug Problem: You are given two jugs, a 4-gallon one and a 3-gallon 8 CL3/CO1
2
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.
b. Explain Tic-Tac-Toe Program using Make2, Posswin (p) and Goal(n) and
6 CL2/CO1
Magic Square Method with an example.
c. Solve the crypto arithmetic problem: SEND + MORE = MONEY. 6 CL3/CO1
Module II
3 a. Solve eight puzzle problem using A* algorithm. 7 CL3/CO2
b. Explain the following algorithm: 6 CL2/CO2
i. Simulated Annealing
ii. Generate and Test algorithm
c. Apply and write AO* algorithm for the following graph and find final path. 7 CL3/CO2
Page 1 of 5
OR
a. Write and apply A* algorithm and find the most cost-effective path from start 7 CL3/CO2
4
state A to final state J.
b. Explain the different approaches to knowledge representation with an example. 6 CL2/CO2
c. Illustrate the following: 7 CL3/CO2
i. Simple Hill Climbing
ii. Steepest Ascent Hill Climbing
Module III
a. Solve Decision trees for the following set of training examples. 7 CL3/CO3
5
RI Age Incom Stude Credit- Class: Buy’s
D e nt Rating Computer
1 Youth High No Fair No
2 Youth High No Excellent No
3 Middle- High No Fair Yes
Aged
4 Senior Mediu No Fair Yes
m
5 Senior Low Yes Fair Yes
6 Senior Low Yes Excellent No
Page 2 of 5
b. List out the steps of Candidate Elimination Algorithm. Apply the algorithm to 8 CL3/CO3
obtain the final version space for the training example
Origin Manufacturer Color Decade Type Example Type
Japan Honda Blue 1980 Economy Positive
Japan Toyota Green 1970 Sports Negative
Japan Toyota Blue 1990 Economy Positive
USA Chrysler Red 1980 Economy Negative
Japan Honda White 1980 Economy Positive
c. Summarize the appropriate problems for Decision Tree Learning method. 5 CL2/CO3
OR
a. Apply the FIND-S algorithm to the dataset below to determine the final 7 CL3/CO3
6
hypothesis. Also describe the algorithm.
Material Color Type Flexible Class
Plastic Red Box Yes Yes
Metal Red Box No No
Plastic Blue Cylinder Yes Yes
Plastic Blue Box Yes Yes
Metal Blue Box Yes No
b. Consider the following data set for a binary class problem. 8 CL3/CO3
A T T T T T F F F T T
B F T T F T F F F T F
Class Label + + + - + - - - - -
i. What is the entropy of this collection of training examples with respect
to the positive class?
ii. What are the information gains of A and B relative to these training
examples?
iii. Draw a decision tree of the above dataset.
c. Explain the different performance metrics used in machine learning with an 5 CL2/CO3
example.
Module IV
a. Explain the perceptron training rule with a suitable expression. Also derive 6 CL2/CO4
7
the gradient descent rule for minimizing the error in a neural network.
b. The following table gives data set about stolen vehicles. Apply Naive Bayes 6 CL3/CO4
classifier classify the new data {Color: Red, Type: SUV, Origin: Domestic}
Color Type Origin Stolen
Red Sports Domestic Yes
Red Sports Domestic No
Red Sports Domestic Yes
Yellow Sports Domestic No
Yellow Sports Imported Yes
Yellow SUV Imported No
Yellow SUV Imported Yes
Page 3 of 5
Yellow SUV Domestic No
Red SUV Imported No
Red Sports Imported Yes
c. Derive the Stochastic Gradient Descent version of the Back Propagation 8 CL3/CO4
algorithm for feedforward networks containing two layers of sigmoid units.
OR
8 a. Explain Brute force Bayes Concept Learning. 6 CL2/CO4
Consider a medical diagnosis problem in which there are two alternative 8 CL3/CO4
hypotheses: 1. That the patient has a particular form of cancer (+) and 2. That
the patient does not (-). A patient takes a lab test and the result comes back
positive. The test returns a correct positive result in only 98% of the cases in
b.
which the disease is actually present, and a correct negative result in only 97%
of the cases in which the disease is not present. Furthermore, .008 of the entire
population have this cancer. Determine whether the patient has Cancer or not
using MAP hypothesis.
Illustrate Bayesian belief network and conditional independence with 6 CL3/CO4
c.
example.
Module V
Prove the K – nearest neighbor algorithm for approximating a discrete – valued function 8 CL3/CO5
9 a.
with pseudocode.
b. Explain Locally Weighted Linear Regression. 6 CL2/CO5
With a neat sketch briefly explain Global Approximation of Radial basis 6 CL2/CO5
c.
Function.
OR
10 a. Demonstrate the Linear and non-linear SVM classification with an example. 8 CL3/CO5
Discuss the learning tasks and Q learning in the context of reinforcement 6 CL2/CO5
b.
learning.
c. Explain CADET system using case-based reasoning. 6 CL2/CO5
Cognitive Levels of Bloom’s Taxonomy
No. CL1 CL2 CL3 CL4 CL5 CL6
Level Remember Understand Apply Analyze Evaluate Create
Course Outcomes
CO1 Illustrate the theory of artificial intelligence for various problem-solving techniques. CL3
Apply artificial intelligence concepts in Heuristic Search Techniques and knowledge CL3
CO2
representation.
Demonstrate the ability to evaluate concept learning tasks and decision tree algorithms to solve CL3
CO3
classification problems.
Apply the concept of neural networks for learning linear and non-linear activation functions and CL3
CO4
Bayesian classifier to label data.
Page 4 of 5
Illustrate clustering, instant based and reinforcement learning algorithms and identify its CL3
CO5
applicability in real life problems.
Page 5 of 5