Professional Documents
Culture Documents
1
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
IV B.Tech. I Sem., I Mid-Term Examinations, September-2017
MACHINE LEARNING
Objective Exam
Name: ______________________________ Hall Ticket No. A
Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 10.
1. The __________boundary of version space V S h,d is the set of its maximally specific members.
A) Specific B) General C) Version Space D) Consistent [ ]
3. The key idea in the ________algorithm is to output a description of the set of all hypotheses consistent
with the training examples.
A) Find-S B) Candidate-Elimination C) List-Then-Eliminate D) General Boundary [ ]
6. _______learning is one of the most widely used and practical methods for inductive inference.
A) Decision tree B) Inductive Bias C) Node D) All [ ]
10. Decision trees classify instances by sorting them down the tree from the root to some leaf node, which
provides the classification of the__________.
A) Node B) Root C) Instance D) All [ ]
Cont..2
Code No:117EF :2: Set No. 1
14. The key property of the __________ algorithm is that for hypothesis spaces described by conjunctions of
attribute constraints.
16. The inductive CANDIDATEELIMINATION algorithm at the top of the figure takes two inputs: the
____________ and a ______________ to be classified.
17. The output hypotheses and classifications of subsequent instances follow ______________ from this
assumption together with the observed training data.
18. Version spaces and the _____________ algorithm provide a useful conceptual framework for studying
concept learning.
20. _____________ searches the space of possible hypotheses using gradient descent to iteratively reduce the
error in the network fit to the training examples.
-oOo-
Code No: 117EF Set No. 2
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
IV B.Tech. I Sem., I Mid-Term Examinations, September-2017
MACHINE LEARNING
Objective Exam
Name: ______________________________ Hall Ticket No. A
Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 10.
3. _______learning is one of the most widely used and practical methods for inductive inference.
A) Decision tree B) Inductive Bias C) Node D) All [ ]
7. Decision trees classify instances by sorting them down the tree from the root to some leaf node, which
provides the classification of the__________.
A) Node B) Root C) Instance D) All [ ]
8. The __________boundary of version space V S h,d is the set of its maximally specific members.
A) Specific B) General C) Version Space D) Consistent [ ]
10. The key idea in the ________algorithm is to output a description of the set of all hypotheses consistent
with the training examples.
A) Find-S B) Candidate-Elimination C) List-Then-Eliminate D) General Boundary [ ]
Cont..2
Code No:117EF :2: Set No. 2
11. The key property of the __________ algorithm is that for hypothesis spaces described by conjunctions of
attribute constraints.
13. The inductive CANDIDATEELIMINATION algorithm at the top of the figure takes two inputs: the
____________ and a ______________ to be classified.
14. The output hypotheses and classifications of subsequent instances follow ______________ from this
assumption together with the observed training data.
15. Version spaces and the _____________ algorithm provide a useful conceptual framework for studying
concept learning.
17. _____________ searches the space of possible hypotheses using gradient descent to iteratively reduce the
error in the network fit to the training examples.
-oOo-
Code No: 117EF Set No. 3
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
IV B.Tech. I Sem., I Mid-Term Examinations, September-2017
MACHINE LEARNING
Objective Exam
Name: ______________________________ Hall Ticket No. A
Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 10.
1. _______learning is one of the most widely used and practical methods for inductive inference.
A) Decision tree B) Inductive Bias C) Node D) All [ ]
5. Decision trees classify instances by sorting them down the tree from the root to some leaf node, which
provides the classification of the__________.
A) Node B) Root C) Instance D) All [ ]
6. The __________boundary of version space V S h,d is the set of its maximally specific members.
A) Specific B) General C) Version Space D) Consistent [ ]
8. The key idea in the ________algorithm is to output a description of the set of all hypotheses consistent
with the training examples.
A) Find-S B) Candidate-Elimination C) List-Then-Eliminate D) General Boundary [ ]
Cont..2
Code No:117EF :2: Set No. 3
11. The inductive CANDIDATEELIMINATION algorithm at the top of the figure takes two inputs: the
____________ and a ______________ to be classified.
12. The output hypotheses and classifications of subsequent instances follow ______________ from this
assumption together with the observed training data.
13. Version spaces and the _____________ algorithm provide a useful conceptual framework for studying
concept learning.
15. _____________ searches the space of possible hypotheses using gradient descent to iteratively reduce the
error in the network fit to the training examples.
19. The key property of the __________ algorithm is that for hypothesis spaces described by conjunctions of
attribute constraints.
-oOo-
Code No: 117EF Set No. 4
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
IV B.Tech. I Sem., I Mid-Term Examinations, September-2017
MACHINE LEARNING
Objective Exam
Name: ______________________________ Hall Ticket No. A
Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 10.
3. Decision trees classify instances by sorting them down the tree from the root to some leaf node, which
provides the classification of the__________.
A) Node B) Root C) Instance D) All [ ]
4. The __________boundary of version space V S h,d is the set of its maximally specific members.
A) Specific B) General C) Version Space D) Consistent [ ]
6. The key idea in the ________algorithm is to output a description of the set of all hypotheses consistent
with the training examples.
A) Find-S B) Candidate-Elimination C) List-Then-Eliminate D) General Boundary [ ]
9. _______learning is one of the most widely used and practical methods for inductive inference.
A) Decision tree B) Inductive Bias C) Node D) All [ ]
Cont..2
Code No:117EF :2: Set No. 4
11. Version spaces and the _____________ algorithm provide a useful conceptual framework for studying
concept learning.
13. _____________ searches the space of possible hypotheses using gradient descent to iteratively reduce the
error in the network fit to the training examples.
17. The key property of the __________ algorithm is that for hypothesis spaces described by conjunctions of
attribute constraints.
19. The inductive CANDIDATEELIMINATION algorithm at the top of the figure takes two inputs: the
____________ and a ______________ to be classified.
20. The output hypotheses and classifications of subsequent instances follow ______________ from this
assumption together with the observed training data.
-oOo-