Scribd
Upload
62 views2 pages

Rcse 002

1) The document describes a Ph.D. exam in computer science focusing on machine learning. It provides 5 questions covering topics like designing learning systems, decision tree algorithms, Naive Bayes classifiers, PAC learning models, and algorithms like candidate elimination and ID3. 2) Question 1 asks to describe steps to design a learning system, explain the FIND-S algorithm, and illustrate decision tree representation. 3) Other questions cover PAC learning, evaluating learned hypotheses, candidate elimination algorithm, ID3 decision trees, VC dimension, and the mistake bound model.

Uploaded by

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

Rcse 002

1) The document describes a Ph.D. exam in computer science focusing on machine learning. It provides 5 questions covering topics like designing learning systems, decision tree algorithms, Naive Bayes classifiers, PAC learning models, and algorithms like candidate elimination and ID3. 2) Question 1 asks to describe steps to design a learning system, explain the FIND-S algorithm, and illustrate decision tree representation. 3) Other questions cover PAC learning, evaluating learned hypotheses, candidate elimination algorithm, ID3 decision trees, VC dimension, and the mistake bound model.

Uploaded by

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

[2] RCSE-002

functions, in which the learned function is


No. of Printed Pages : 3 RCSE-002 represented by a decision-tree.” Illustrate
the decision-tree representation for “play
Ph. D. IN COMPUTER SCIENCE tennis” example to classify Saturday
(PHDCS) mornings according to whether or not they
are suitable for playing tennis. 10
Term-End Examination
(d) With the help of an example, explain Naive
December, 2021
Bayes classifier. 10
RCSE-002 : MACHINE LEARNING
2. (a) Describe the Probably Approximately
Time : 3 Hours Maximum Marks : 100 Correct (PAC) learning model. 10
Weightage : 50%
(b) What are the various methods for
Note : (i) Questions No. 1 is compulsory. evaluating learned hypotheses ? Explain
them briefly. 10
(ii) Answer any three questions from the
rest. 3. (a) Write and explain the candidate
elimination learning algorithm using
1. (a) Write the steps briefly to design a
version spaces. 10
“Learning System”. Illustrate this with the
(b) Describe briefly the widely used ID3
help of an example. 10
decision tree learning algorithm with an
(b) Write and explain the FIND-S algorithm example. 10
for finding a maximally specific hypothesis.
4. (a) Briefly explain Vapnik-Chervonenkis
10 dimension which is one of the useful
(c) “Decision tree learning is a method for measures of the complexity of a hypothesis
approximating discrete-valued target space. 10

P. T. O.
[3]

(b) “Mistake bound model is used to analyse


the number of training examples a learner
will misclassify before it exactly learns the
target concept.” Explain the model with the
help of an example. 10

5. Write short notes on any four of the following :

4×5=20
(a) Weighted-Majority algorithm

(b) Learning Bayesian belief networks

(c) Paired t-tests

(d) Issues in Decision-tree learning

(e) Issues in Machine learning

RCSE-002

You might also like