Scribd
Upload
5 views2 pages

18CS71 Ia1 QP

The document discusses several machine learning algorithms including Candidate Elimination, List then Eliminate, Find S, ID3, and Perceptron. It provides examples to demonstrate how each algorithm works and asks questions to test understanding of concepts like inductive learning and decision tree learning.

Uploaded by

roslinemary
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
5 views2 pages

18CS71 Ia1 QP

The document discusses several machine learning algorithms including Candidate Elimination, List then Eliminate, Find S, ID3, and Perceptron. It provides examples to demonstrate how each algorithm works and asks questions to test understanding of concepts like inductive learning and decision tree learning.

Uploaded by

roslinemary
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

USN 1 V I CBCS 18CS71

INTERNAL ASSESSMENT – I
PROGRAM : U.G.
SEM & SEC : VII / ‘A’ & ‘B’ DATE: 23/11/2021
SUBJECT : Artificial Intelligence & Machine Learning TIME: 9:00 –10:15 AM
FACULTY : A.Rosline Mary & Suma S MAX. MARKS: 30

Note: Answer any TWO full questions, selecting at least ONE full question from each part.

Q PO / BT/
Question Marks CO
No. PSOs CL

1 Demonstrate Candidate Elimination algorithm. Apply the algorithm to 10M CO2 PO1, L3
obtain the specific and general boundary for the following training example
a PO2,
describing pair of people live in some house. Each training example is an
ordered pair of people with their gender, hair color, height and nationality. PSO1

1+<<male brown tall US><female black short US>>


2+<<male brown short French><female black short US>>
3-<<female brown tall German><female black short Indian>>
4+<<male brown tall Irish><female brown short Irish>>
Define Concept Learning. Also Demonstrate List then Eliminate 5M CO2 L2
Algorithm.
b
OR
2 Demonstrate the Find S algorithm. Explain its working for the following 8M CO2 L2
training example.
a
Day Sky AirTemp Humidity Wind Water Forecast EnjoySport
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
Explain Inductive Learning Hypothesis. 7M CO2 L2
b
3 Apply the following set of training examples for the ID3 algorithm: 10M CO3 L3
a a) What is the entropy of this collection of training example with
respect to the target function classification?

Page 1 of 2
USN 1 V I CBCS 18CS71

b) What is the information gain of a2 relative to these training


examples?
Instance Classification a1 a2
1 + T T
2 + T T
3 - T F
4 + F F
5 - F T
6 - F T
Construct Decision trees to represent the Boolean Functions: 5M CO3 L6
b i. A && ~ B
ii. A V [B && C]
iii. A XOR B
iv. [A&&B] V [C&&D]
OR
4 What is decision tree learning? Demonstrate an ID3 algorithm for building 7M CO3 L2
a decision tree.
a
Explain the concept of a Perceptron with a neat diagram. Also How a 8M CO3 L2
b single perceptron can be used to represent the Boolean functions such as
AND, OR.

Faculty QAC HoD

Page 2 of 2

You might also like