Artificial Intelligence MCQs with Answers
Practice important Artificial Intelligence MCQs with answers and explanations.
Chapter: 35
Q1101:
Which hypothesis matches the concept C2 from the concept space?
A. <Ø, Ø>
B. <L, L>
C. <?, ?>
D. <N, H>
Correct Answer:
B
Chapter: 36
Q1102:
What is the primary goal of the FIND-S algorithm?
A. To find the most general hypothesis
B. To find the most accurate hypothesis
C. To find the maximally specific hypothesis
D. To eliminate all negative examples
Correct Answer:
C
Chapter: 36
Q1103:
FIND-S algorithm starts with which type of hypothesis?
A. Most general
B. Most specific
C. Random
D. Null
Correct Answer:
B
Chapter: 36
Q1104:
What does the FIND-S algorithm do when it encounters a positive training example?
A. Specializes the hypothesis
B. Discards the example
C. Generalizes the hypothesis
D. Makes no changes
Correct Answer:
C
Chapter: 36
Q1105:
What does the FIND-S algorithm do when it encounters a negative training example?
A. Specializes the hypothesis
B. Generalizes the hypothesis
C. Ignores the example
D. Deletes the hypothesis
Correct Answer:
C
Chapter: 36
Q1106:
What type of training examples does the FIND-S algorithm use for updating the hypothesis?
A. Positive
B. Negative
C. Both
D. Neither
Correct Answer:
A
Chapter: 36
Q1107:
Which of the following is a key assumption of the FIND-S algorithm?
A. All data is random
B. Training data may have errors
C. Training data is inconsistent
D. Training data is consistent
Correct Answer:
D
Chapter: 36
Q1108:
In the FIND-S algorithm, what symbol is used to generalize an attribute that does not match?
A. Ø
B. #
C. ?
D. *
Correct Answer:
C
Chapter: 36
Q1109:
What happens to the hypothesis h after processing the first positive example in FIND-S?
A. It becomes empty
B. It becomes maximally general
C. It is set to match the first positive example
D. It remains unchanged
Correct Answer:
C
Chapter: 36
Q1110:
If a constraint in hypothesis h is satisfied by a positive example, what does FIND-S do?
A. Replaces it with Ø
B. Replaces it with ?
C. Replaces it with more specific constraint
D. Does nothing
Correct Answer:
D
Chapter: 36
Q1111:
What is a limitation of FIND-S in real-world data?
A. It handles noise well
B. It finds all consistent hypotheses
C. It assumes consistent data
D. It handles both positive and negative examples well
Correct Answer:
C
Chapter: 36
Q1112:
What will be the final hypothesis h after processing examples (<H,H>,1), (<L,L>,0), (<N,H>,1)?
A. <Ø, Ø>
B. <H, H>
C. <?, ?>
D. <?, H>
Correct Answer:
D
Chapter: 36
Q1113:
The FIND-S algorithm always outputs the ________ hypothesis consistent with the positive examples.
A. Maximally general
B. Maximally specific
C. Average
D. Random
Correct Answer:
B
Chapter: 36
Q1114:
In FIND-S, hypothesis h is initialized with the most _________ hypothesis.
A. general
B. specific
C. accurate
D. complete
Correct Answer:
B
Chapter: 36
Q1115:
FIND-S replaces each Ø in the initial hypothesis with the _________ attribute value of the first positive example.
A. least frequent
B. random
C. specific
D. exact
Correct Answer:
D
Chapter: 36
Q1116:
FIND-S replaces attribute values that conflict with new positive examples with ________.
A. Ø
B. ?
C. *
D. #
Correct Answer:
B
Chapter: 36
Q1117:
FIND-S works by moving from ______ to ______ in the hypothesis space.
A. general, specific
B. specific, general
C. specific, random
D. general, random
Correct Answer:
B
Chapter: 36
Q1118:
FIND-S fails to identify all hypotheses in the ________.
A. positive set
B. hypothesis list
C. version space
D. negative list
Correct Answer:
C
Chapter: 36
Q1119:
FIND-S is an example of _______ learning.
A. unsupervised
B. reinforcement
C. inductive
D. supervised
Correct Answer:
D
Chapter: 36
Q1120:
The version space includes ________ hypotheses consistent with training examples.
A. some
B. all
C. few
D. no
Correct Answer:
B