A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. Consider the following terminology and match List I with List II and choose the correct answer from the code given below.

b = branching factor
d = depth of the shallowest solution
m = maximum depth of the search tree
l = depth limit

List I List II
(Algorithms) (Space Complexity)
(a) BFS search (i) O(bd)
(b) DFS search (ii) O(b^d)
(c) Depth-limited search (iii) O(bm)
(d) Iterative deepening search (iv) O(bl)
a. (a) – (i), (b)-(ii), (c)-(iv), (d)-(iii)
b. (a) – (ii), (b)-(iii), (c)-(iv), (d)-(i)
c. (a) – (iii), (b)-(ii), (c)-(iv), (d)-(i)
d. (a) – (i), (b)-(iii), (c)-(iv), (d)-(ii)
Answer:(a) – (ii), (b)-(iii), (c)-(iv), (d)-(i)
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: