||JAI SRI GURUDEV||

Sri Adichunchanagiri Shikshana Trust (R)

SJB Institute of Technology
(An autonomous Institute under Visvesvaraya Technological University, Belagavi)
Approved by AICTE, New Delhi, Recognized by UGC, New Delhi with 2 (f) & 12 (B)
Accredited by NAAC with ‘A+’ Grade, Accredited by National Board of Accreditation)
No. 67, BGS Health & Education City, Dr. Vishnuvardhan Road, Kengeri, Bengaluru-560060
DEPARTMENT OF INFORMATION SCIENCE & ENGINEERING

ASSIGNMENT-2

Subject: AI & ML Section/Sem: Vth /A & B sec Total Marks: 10Marks

Subject Code: 21CS54 Date of Assignment: 23/03/2024 Faculty Incharge: Yamuna U &
Rajeshwari S

MODULE-4 & 5

Sl. Question Bloom’s CO

No Level

1 Consider a perceptron to represent the Boolean function AND with the initial weights L5 CO4
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.
2 Consider the array of points as shown in the following table. L3 CO5

Objects X Y
0 1 4
1 2 8
2 5 10
3 12 18
4 14 28
Apply single linkage algorithm and draw Dendrogram for the above table.
3 Consider the training dataset and derive version space for the table given below L6 CO4

S.NO Fever Cough Throat_Pain Body_Pain Covid-19

1 Y Y Y Y Positive
2 Y N Y Y Positive
3 N Y N N Negative
4 Y Y Y N Positive
5 N N N Y Negative
 ||JAI SRI GURUDEV||
Sri Adichunchanagiri Shikshana Trust (R)
SJB Institute of Technology
(An autonomous Institute under Visvesvaraya Technological University, Belagavi)
Approved by AICTE, New Delhi, Recognized by UGC, New Delhi with 2 (f) & 12 (B)
Accredited by NAAC with ‘A+’ Grade, Accredited by National Board of Accreditation)
No. 67, BGS Health & Education City, Dr. Vishnuvardhan Road, Kengeri, Bengaluru-560060
DEPARTMENT OF INFORMATION SCIENCE & ENGINEERING
4 Apply the Find-S algorithm to a specific example dataset comprising positive and negative L3 CO5
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.
5 Predict a student’s performance using Naïve Bayes algorithm for the continuous attribute L6 CO3
the target variable is Job offer whether 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
6 Design the ID3 Decision Tree Algorithm write step-by-step procedure. Provide the L6 CO3
advantages and disadvantages of Decision Trees.

Last date for Submission: 6/03/2024

*******************************