a) true b) false Answer: a Explanation: The idea behind bidirectional search is to ...
View QuestionDFS is ______ efficient and BFS is __________ efficient.
a) Space, Time b) Time, Space c) Time, Time d) Space, Space Answer: ...
View QuestionFor 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 ...
View QuestionLIFO is ______ where as FIFO is ________
a) Stack, Queue b) Queue, Stack c) Priority Queue, Stack d) Stack. Priority Queue Answer: ...
View QuestionOptimality of BFS is ___________
a) When there is less number of nodes b) When all step costs are equal c) When ...
View QuestionBreadth-first search always expands the ______ node in the current fringe of the search tree.
a) Shallowest b) Child node c) Deepest d) Minimum cost Answer: a Explanation: Breadth-first search always expands the ...
View QuestionDepth-first search always expands the ______ node in the current fringe of the search tree.
a) Shallowest b) Child node c) Deepest d) Minimum cost Answer: ...
View Questionuniform-cost search expands the node n with the __________
a) Lowest path cost b) Heuristic cost c) Highest path cost d) Average path cost Answer: a
View QuestionBreadth-first search is not optimal when all step costs are equal, because it always expands the shallowest unexpanded node.
a) true b) false Answer: b Explanation: Breadth-first search is optimal when all step costs are ...
View QuestionThe time and space complexity of BFS is (For time and space complexity problems consider b as branching factor and d as depth of the search tree.)
a) O(bd+1) and O(bd+1) b) O(b2) and O(d2) c) O(d2) and O(b2) d) O(d2) and O(d2) Answer: ...
View Question