Explanation: O(bm) is the space complexity where b is the branching factor and m is the maximum depth of the search tree. 4. Which search algorithm imposes a fixed depth limit on nodes?
A. Depth-limited search
B. Depth-first search
C. Iterative deepening search
D. Bidirectional search
Answer:A
Explanation: O(bm) is the space complexity where b is the branching factor and m is the maximum depth of the search tree. 4. Which search algorithm imposes a fixed depth limit on nodes?
A. Depth-limited search B. Depth-first search C. Iterative deepening search D. Bidirectional search
Explanation: At each level of tree DFS is performed. Main drawback of this algorithm is shallow nodes are expanded again and again. 5. LIFO is ______ where as FIFO is ________?