ESE 2026Q33
Q: Which one of the following is the time complexity of Iterative Deepening in Uninformed Search Strategies?
(a)O(bd)
(b)O(bl)
(c)O(b^d)
(d)O(b^l)
Answer pending verification
Loading...
ESE 2026Q. 33 of 100
Loading...
Q: Which one of the following is the time complexity of Iterative Deepening in Uninformed Search Strategies?