Code No: 117EF Set No.

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.

I. Choose the correct alternative:

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 [ ]

2. A hypothesis h is _________with a set of training examples D of target concept c

A) Inconsistent B) Hypothesis C) Consistent D) None [ ]

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 [ ]

4. How many inputs are there for Equivalent deductive system.1

A) 3 B) 6 C) 9 D) 10 [ ]

5. The ROTE-LEARNER has _________inductive bias.

A) Dual B) Multiple C) No D) Yes [ ]

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 [ ]

7. The target function has discrete _________ values.

A) Input B) Multiple C) Output D) Both A&B [ ]

8. A single perceptron can be used to represent many __________functions.

A) Boolean B) Algebraic C) AND D) NOT [ ]

9. A hypothesis h in H such that _________ for all x in D.

A) h(x)-c(x) B) h(x)+c(x) C) h(x)=c(x) D) h(x)*c(x) [ ]

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

II Fill in the Blanks

11. Output the list of hypotheses in ____________.

12. S and G _____________characterize learner's uncertainty.

13. Inductive leaps possible only if learner is _______________.

14. The key property of the __________ algorithm is that for hypothesis spaces described by conjunctions of
attribute constraints.

15. In general, the set of all subsets of a set X is called the__________ of X.

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.

19. Instances are described by a fixed set of ____________________and their values.

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.

I. Choose the correct alternative:

1. How many inputs are there for Equivalent deductive system.1

A) 3 B) 6 C) 9 D) 10 [ ]

2. The ROTE-LEARNER has _________inductive bias.

A) Dual B) Multiple C) No D) Yes [ ]

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 [ ]

4. The target function has discrete _________ values.

A) Input B) Multiple C) Output D) Both A&B [ ]

5. A single perceptron can be used to represent many __________functions.

A) Boolean B) Algebraic C) AND D) NOT [ ]

6. A hypothesis h in H such that _________ for all x in D.

A) h(x)-c(x) B) h(x)+c(x) C) h(x)=c(x) D) h(x)*c(x) [ ]

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 [ ]

9. A hypothesis h is _________with a set of training examples D of target concept c

A) Inconsistent B) Hypothesis C) Consistent D) None [ ]

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

II Fill in the Blanks

11. The key property of the __________ algorithm is that for hypothesis spaces described by conjunctions of
attribute constraints.

12. In general, the set of all subsets of a set X is called the__________ of X.

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.

16. Instances are described by a fixed set of ____________________and their values.

17. _____________ searches the space of possible hypotheses using gradient descent to iteratively reduce the
error in the network fit to the training examples.

18. Output the list of hypotheses in ____________.

19. S and G _____________characterize learner's uncertainty.

20. Inductive leaps possible only if learner is _______________.

-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.

I. Choose the correct alternative:

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 [ ]

2. The target function has discrete _________ values.

A) Input B) Multiple C) Output D) Both A&B [ ]

3. A single perceptron can be used to represent many __________functions.

A) Boolean B) Algebraic C) AND D) NOT [ ]

4. A hypothesis h in H such that _________ for all x in D.

A) h(x)-c(x) B) h(x)+c(x) C) h(x)=c(x) D) h(x)*c(x) [ ]

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 [ ]

7. A hypothesis h is _________with a set of training examples D of target concept c

A) Inconsistent B) Hypothesis C) Consistent D) None [ ]

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 [ ]

9. How many inputs are there for Equivalent deductive system.1

A) 3 B) 6 C) 9 D) 10 [ ]

10. The ROTE-LEARNER has _________inductive bias.

A) Dual B) Multiple C) No D) Yes [ ]

Cont..2
Code No:117EF :2: Set No. 3

II Fill in the Blanks

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.

14. Instances are described by a fixed set of ____________________and their values.

15. _____________ searches the space of possible hypotheses using gradient descent to iteratively reduce the
error in the network fit to the training examples.

16. Output the list of hypotheses in ____________.

17. S and G _____________characterize learner's uncertainty.

18. Inductive leaps possible only if learner is _______________.

19. The key property of the __________ algorithm is that for hypothesis spaces described by conjunctions of
attribute constraints.

20. In general, the set of all subsets of a set X is called the__________ of X.

-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.

I. Choose the correct alternative:

1. A single perceptron can be used to represent many __________functions.

A) Boolean B) Algebraic C) AND D) NOT [ ]

2. A hypothesis h in H such that _________ for all x in D.

A) h(x)-c(x) B) h(x)+c(x) C) h(x)=c(x) D) h(x)*c(x) [ ]

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 [ ]

5. A hypothesis h is _________with a set of training examples D of target concept c

A) Inconsistent B) Hypothesis C) Consistent D) None [ ]

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 [ ]

7. How many inputs are there for Equivalent deductive system.1

A) 3 B) 6 C) 9 D) 10 [ ]

8. The ROTE-LEARNER has _________inductive bias.

A) Dual B) Multiple C) No D) Yes [ ]

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 [ ]

10. The target function has discrete _________ values.

A) Input B) Multiple C) Output D) Both A&B [ ]

Cont..2
Code No:117EF :2: Set No. 4

II Fill in the Blanks

11. Version spaces and the _____________ algorithm provide a useful conceptual framework for studying
concept learning.

12. Instances are described by a fixed set of ____________________and their values.

13. _____________ searches the space of possible hypotheses using gradient descent to iteratively reduce the
error in the network fit to the training examples.

14. Output the list of hypotheses in ____________.

15. S and G _____________characterize learner's uncertainty.

16. Inductive leaps possible only if learner is _______________.

17. The key property of the __________ algorithm is that for hypothesis spaces described by conjunctions of
attribute constraints.

18. In general, the set of all subsets of a set X is called the__________ of X.

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-