Depth-first search always expands the……… node in the current fringe of the search tree.
a) Shallowest
b) Child node
c) Deepest
d) Minimum cost
Explanation: Depth-first search always expands the deepest/leaf node in the current fringe of the search tree.
Breadth-first search always expands the……..node in the current fringe of the search tree.
a) Shallowest
b) Child node
c) Deepest
d) Minimum cost
Explanation: Breadth-first search always expands the shallowest node in the current fringe of the search tree. Traversal is performed level wise.
Optimality of BFS is…………
a) When there is less number of nodes
b) When all step costs are equal
c) When all step costs are unequal
d) None of the mentioned
Explanation: It always expands the shallowest unexpanded node.
LIFO is…….whereas FIFO is……..
a) Stack, Queue
b) Queue, Stack
c) Priority Queue, Stack
d) Stack. Priority Queue
Explanation: LIFO is last in first out – Stack. FIFO is first in first out – Queue.
For general graph, how one can get rid of repeated states?
a) By maintaining a list of visited vertices
b) By maintaining a list of traversed edges
c) By maintaining a list of non-visited vertices
d) By maintaining a list of non-traversed edges
Explanation: Other techniques are costly.
DFS is……..efficient and BFS is…….. efficient.
a) Space, Time
b) Time, Space
c) Time, Time
d) Space, Space
