Artificial Intelligence MCQs with Answers
Practice important Artificial Intelligence MCQs with answers and explanations.
Chapter: 36
Q1121:
FIND-S only generalizes a hypothesis when a ________ example is not covered.
A. positive
B. negative
C. random
D. neutral
Correct Answer:
A
Chapter: 36
Q1122:
If BP = H, what does the final hypothesis < ?, H > classify a patient as?
A. Healthy
B. Uncertain
C. SICK
D. Unclassified
Correct Answer:
C
Chapter: 36
Q1123:
The FIND-S algorithm performs generalization when the hypothesis fails to ________ a positive example.
A. match
B. cover
C. include
D. verify
Correct Answer:
B
Chapter: 36
Q1124:
FIND-S assumes the hypothesis space H contains a hypothesis that matches the ________ concept.
A. 1
B. estimated
D. experimental
Correct Answer:
A
Chapter: 36
Q1125:
The FIND-S algorithm uses _______ ordering of hypothesis space.
A. specific to general
B. random
C. symbolic
D. backward chaining
Correct Answer:
A
Chapter: 36
Q1126:
The final hypothesis in FIND-S after three examples represents the most _______ consistent with training data.
A. accurate
B. specific
C. general
D. complete
Correct Answer:
B
Chapter: 37
Q1127:
What is the key idea behind the Candidate-Elimination algorithm?
A. To find one hypothesis that fits the data
B. To eliminate all negative hypotheses
C. To describe all consistent hypotheses with training examples
D. To randomly generate hypotheses
Correct Answer:
C
Chapter: 37
Q1128:
The Candidate-Elimination algorithm maintains which two boundary sets?
A. A and B
B. C and D
C. G and S
D. X and Y
Correct Answer:
C
Chapter: 37
Q1129:
In the Candidate-Elimination algorithm, what does 'G' represent?
A. Specific hypotheses
B. General hypotheses
C. Good hypotheses
D. Generic examples
Correct Answer:
B
Chapter: 37
Q1130:
What does 'S' represent in the Candidate-Elimination algorithm?
A. General hypotheses
B. Specific hypotheses
C. Sample examples
D. Simplified hypotheses
Correct Answer:
B
Chapter: 37
Q1131:
In the Candidate-Elimination algorithm, the hypothesis space is restricted between ______.
A. G0 and S0
B. All positive examples
C. All negative examples
D. Training data only
Correct Answer:
A
Chapter: 37
Q1132:
Candidate-Elimination algorithm modifies 'S' by making it more ______ with each positive example.
A. complex
B. specific
C. general
D. undefined
Correct Answer:
C
Chapter: 37
Q1133:
Candidate-Elimination algorithm modifies 'G' by making it more ______ with each negative example.
A. general
B. consistent
C. specific
D. random
Correct Answer:
C
Chapter: 37
Q1134:
Initial value of G in Candidate-Elimination algorithm is
A. {< Ø , Ø >}
B. {< ?, ? >}
C. {< H, H >}
D. None
Correct Answer:
B
Chapter: 37
Q1135:
Initial value of S in Candidate-Elimination algorithm is
A. {< Ø , Ø >}
B. {< ?, ? >}
C. {< H, H >}
D. None
Correct Answer:
A
Chapter: 37
Q1136:
After processing all examples, Candidate-Elimination returns ______.
A. One random hypothesis
B. All incorrect hypotheses
C. Hypotheses consistent with examples
D. Only positive hypotheses
Correct Answer:
C
Chapter: 37
Q1137:
Version space is defined as
A. All incorrect hypotheses
B. Hypotheses consistent with training data
C. All negative hypotheses
D. None
Correct Answer:
B
Chapter: 37
Q1138:
Which hypothesis is more specific than <?,H>?
A. <Ø,Ø>
B. <H,H>
C. <?,?>
D. <N,H>
Correct Answer:
B
Chapter: 37
Q1139:
Which hypothesis is more general than <H,H>?
A. <?,?>
B. <?,L>
C. <Ø,Ø>
D. None
Correct Answer:
A
Chapter: 37
Q1140:
A positive example causes which of the following changes in S set?
A. Adding more specific hypotheses
B. Removing consistent hypotheses
C. Adding minimal generalizations
D. None
Correct Answer:
C