Artificial Intelligence MCQs with Answers
Practice important Artificial Intelligence MCQs with answers and explanations.
Chapter: 7
Q201:
BFS tends to explore the tree ______.
A. Level by level
B. In depth
C. From bottom
D. Using heuristic
Correct Answer:
A
Chapter: 7
Q202:
In DFS, node with the ______ value of height is picked first.
A. Minimum
B. Maximum
C. Average
D. Random
Correct Answer:
B
Chapter: 7
Q203:
In BFS, node with the ______ value of height is picked first.
A. Minimum
B. Maximum
C. Equal
D. Random
Correct Answer:
A
Chapter: 7
Q204:
The search stops when ________.
A. Node cost becomes zero
B. Goal node is found
C. Q has more than 3 nodes
D. Q becomes empty or goal is found
Correct Answer:
D
Chapter: 7
Q205:
Which node is picked first from the priority queue in DFS?
A. Node with smallest ID
B. Node with maximum height
C. Node with lowest cost
D. Node with most children
Correct Answer:
B
Chapter: 7
Q206:
Which queue operation is used in Simple Search Algorithm?
A. Insert at front
B. Insert at rear
C. Remove node X
D. All of these
Correct Answer:
D
Chapter: 7
Q207:
In BFS, if multiple nodes have same height, the algorithm picks
A. Goal node first
B. Node with smallest ID
C. Any one of them
D. Randomly selects one
Correct Answer:
C
Chapter: 7
Q208:
The purpose of Visited set is to
A. Avoid cycles
B. Sort nodes
C. Track unvisited paths
D. Identify cost-effective nodes
Correct Answer:
A
Chapter: 7
Q209:
In DFS, if current node is not goal, algorithm
A. Returns it
B. Adds it to queue
C. Removes it and adds children to queue
D. Terminates
Correct Answer:
C
Chapter: 7
Q210:
The function P(n) in DFS is defined as
A. P(n) = height(n)
B. P(n) = cost(n)
C. P(n) = 1/height(n)
D. P(n) = 1/depth(n)
Correct Answer:
C
Chapter: 7
Q211:
Which one is TRUE about BFS?
A. It selects deeper nodes first
B. It selects random nodes
C. It uses 1/height(n) as priority
D. It selects shallower nodes first
Correct Answer:
D
Chapter: 7
Q212:
Which of the following searches explores more area of search space in general?
A. DFS
B. BFS
C. Greedy
D. Uniform Cost Search
Correct Answer:
B
Chapter: 7
Q213:
Q is initialized with ________.
A. S only
B. Goal node
C. Empty queue
D. Visited list
Correct Answer:
A
Chapter: 7
Q214:
If node X is a goal node, algorithm will ________.
A. Ignore X
B. Skip X
C. Return X
D. Reinitialize Q
Correct Answer:
C
Chapter: 7
Q215:
Which part of the algorithm determines the search type (DFS/BFS)?
A. Visited set
B. Queue type
C. Priority function
D. Pick step from Q
Correct Answer:
C
Chapter: 7
Q216:
What is added to Visited list during the algorithm execution?
A. Goal node only
B. Start node only
C. All nodes visited
D. Only failed nodes
Correct Answer:
C
Chapter: 7
Q217:
The same Simple Search Algorithm applies to ________.
A. Informed search only
B. Uninformed search only
C. Both A and B
D. Heuristic search
Correct Answer:
C
Chapter: 7
Q218:
DFS is effective when goal is located ______.
A. Near root
B. In deep leaf
C. In middle node
D. Unknown location
Correct Answer:
B
Chapter: 7
Q219:
The algorithm returns H if ________.
A. H is found to be a goal
B. H has highest cost
C. H is the start node
D. H is not in Visited
Correct Answer:
A
Chapter: 8
Q220:
Which of the following is a major drawback of DFS?
A. It always finds the shallowest goal
B. It requires exponential space
C. It can run forever in infinite paths
D. It is too slow
Correct Answer:
C