|| Jai Sri Gurudev ||

®
Sri AdichunchanagiriShikshana Trust

SJB Institute of Technology

(A Constituent of BGS & SJB Group of Institutions and Hospitals)
BGS Health & Education City, Dr. Vishnuvardhan Road, Kengeri, Bengaluru-560060
Affiliated to Visvesvaraya Technological University, Belagavi. Approved by AICTE, New Delhi. Accredited by
NAAC, New Delhi with ‘A’ Grade. Recognized by UGC, New Delhi with 2(f) and 12(B). Certified by ISO 9001-2015

DEPARTMENT OF INFORMATION SCIENCE AND ENGINEERING

Model Question Paper-4

Course: Artificial Intelligence and Machine Learning Maximum marks: 100
Course Code: 21CS54 Duration: 03 hours
Semester: V

Instructions: i).Answer any FIVE full questions. Questions 1 and 2 are compulsory
ii) Missing data, if any, may be suitably assumed
iii) Verify the course code before answering
Q. No. Marks
Question 1 is for 20 marks from UNIT I
1 a) Classify the definitions of Artificial Intelligence and explain each category. 8
b) Categorize Breadth First Search and Depth First Search strategies. 8
c) What are the different criteria used to evaluate the performance of search 4
algorithms.
Question 2 is for 20 marksfrom UNIT II
2 a) Explain in detail the machine learning process model. 8
b) Draw atleast four charts and explain each chart in detail that help data 8
visualization.
c) What are the measures of central tendencies? 4

Question 3 is for 20 marks from UNIT III

3 a) Describe the Candidate Elimination algorithm in detail. Provide step-by-step 10
explanations of how the algorithm works. Apply Candidate Elimination algorithm
with a simple example.
b) Define Regression Analysis. Illustrate the linear and non-linearity relationship and 10
types of Regression methods. Provide the limitations of Regression method.
OR
Question 4 is for 20 marks from UNIT III
4 a) Design K-NN and Weighted K-NN algorithm including input parameters, how the 10
algorithm processes data, and how it determines predictions.

Page 1 of 3
 b) Apply the Find-S algorithm to a specific example dataset comprising positive and 10
negative instances.

S.NO Horns Tail Paws Fur Color Size Elephant

1 No Short No No Black Big Yes
2 Yes Short No No Brown Medium No
3 No Short No No Black Medium Yes
4 No Long Yes Yes White Medium No
5 No Short Yes Yes Black Big Yes
Provide a step-by-step walkthrough of how Find-S works in the context of
machine learning for concept learning and determine the final Hypotheses
generated.
Question 5 is for 20 marks from Unit IV
5 a) Analyze the fundamentals of Bayes theorem that works on the principles of 10
Probability. Provide the equations of Maximum A Posteriori and Maximum
Likelihood Hypothesis.
b) Construct a decision tree and predict the target class for a test instance (7, 1, 6.7) 10
with the training dataset consisting of 10 data instances and 3 attributes.
Sl.No A1 A2 A3 Target Class
1 10 0.5 2.5 Negative
2 7 1.3 3 Positive
3 5 0.7 5.6 Negative
4 9 1.0 4.3 Positive
5 10 1.2 7.1 Positive
6 8 0.9 6.5 Negative
7 6 0.8 3.2 Negative
8 4 1.5 5.1 Negative
9 9 1.7 4.7 Positive
10 8 1.6 7.4 Positive
OR
Question 6 is for 20 marks from Unit IV
6 a) predict a student’s performance using Naïve Bayes algorithm for the continuous 10
attribute the target variable is Job offerwhether a student gets a job offer or not in
his final year of course.

S.NO CGPA Interactiveness Job offer

1 9.5 Yes Yes
2 8.2 No Yes
3 9.3 No No
4 7.6 No No
5 8.4 Yes Yes
6 9.1 Yes Yes
7 7.5 Yes No
8 9.6 No Yes
9 8.6 Yes Yes
10 8.3 Yes Yes
b) Examine the advantages and disadvantages of Decision tree. Design Decision tree 10
ID3 algorithm with steps.
Question 7 is for 20 marks from Unit V
7 a) Consider the following set of data given 10
Objects X-coordinate Y-coordinate
1 2 4
2 4 6

Page 2 of 3
 3 6 8
4 10 4
5 12 4
Design k-means algorithm and Apply k-means algorithm and cluster it using
initial value of objects as 1 and 4.
b) Assess DBSCAN, Dense cells and CLIQUE with appropriate steps. 10
OR
Question 8 is for 20Marks from Unit V
8 a) Elaborate the types of Artificial Neuron Networks with a network diagram. 10
b) Consider a perceptron to represent the Boolean function AND with the initial 10
weights w1=0.3, w2=-0.2, learning rate α=0.2 and bias θ=0.4. The activation
function used here is the step function f(x) which gives the output values as
binary.
Design a perceptron that performs the Boolean function AND and update the
weights until the Boolean function gives the desired output.

Page 3 of 3