Download as pdf or txt
Download as pdf or txt
You are on page 1of 1

BR-20

HT.No. D4
54
SRI INDUCOLLEGE OF QC1704
(An Autonomous
UGC,
ENGINEERING
Institution under New Delhi)- Recognized
& TECHNOLOGY
2() and
under 12(B) of UGCAct 1956
III B.Tech. IISemester
(REG & SUPPL)End Examinations, JUNE-2024.
(R20CSE3201) MACHINE LEARNING
18 /06/2024
Duration: 3 Hrs
(For CSE, IT,AIML, AIDS, DS
CS) & Day- 1(FN)
Blooms Taxonomy: Maximum MarkS: 70M
(-Remembering,II-Understanding, IIM-Applying, IV-Analyzing,
and VI-Creating) V-Evaluating
Course Qutcomes :CO

Answer ALL thefollowing questions.SECTION-A


1. Explain about Well-posed (5Qx 4M=20M)
Learning problems.
2. List and explain about II CO1
attribute selection measures for
Decision trees with süitable II CO2
example.
3. Write shore notes on
Finite and Infinite
Hypothesis spaces.
4. Define FOIL and CO3
summarizethe learning rule sets.
5. What is Q-learning and CO4
mention the advantages of
it.
COS

Answer FIVE questions choosing


SECTION-B
atleast onefróm ech unt.
(5Qx10M =50M)
6. Define
UNIT
Machine learning and explain about
learning.
potential applications ofMachine II CO1

7. a) Explain about Find - S


(OR)
Algorith wth example.
b)Explain about Candidate II CO1
ElinínationAlgorithm and also mention its remarks.
UNIT-II
.8. Write ID3 Algorithm and explain the procedure in buildinga decision tree fromn the
dataset given below. CO2
S.No Age Income Student Credit Class label: Buys
Rating Computer(Yes/NO)
1
youth higí No fair No

2 youth No
high excellent No

3 Middl high No fair Yes


aged
4 Senior medium No fair Yes

5 Senior low Yes fair Yes

6 Senior low Yes excellent Yes

7 Middle low Yes excellent Yes


aged
8 youth medium No fair No

P.T.O

You might also like