The time and space complexity of BFS is (For time and space complexity – McqOptions

MCQOPTIONS

1.	The 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» B. O(b2) and O(d2)

Discussion

No Comment Found

Related MCQs

DEPTH-FIRST_SEARCH_ALWAYS_EXPANDS_THE________NODE_IN_THE_CURRENT_FRINGE_OF_THE_SEARCH_TREE.?$
Optimality of BFS is$
Breadth-first_search_always_expands_the________node_in_the_current_fringe_of_the_search_tree.$
The main idea of Bidirectional search is to reduce the time complexity by searching two way simultaneously from start node and another from goal node.
DFS is ______ efficient and BFS is __________ efficient.
For general graph, how one can get rid of repeated states?
When the environment of an agent is partially observable in search space following problem/problems could occur.
LIFO_is________where_as_FIFO_is_________
uniform-cost search expands the node n with the_________?
Breadth-first search is not optimal when all step costs are equal, because it always expands the shallowest unexpanded node. State whether true or false.