Skip to content
Related Articles

Related Articles

UGC-NET | UGC NET CS 2018 Dec – II | Question 4
  • Last Updated : 01 Oct, 2020

Consider the following terminology and match List 1 and List 2 and choose the correct answer from the code given below
b= branch factor
d= depth of shallowest solution
M= Maximum depth of the search tree
I= depth limit


(A) (a)-(iii), (b)-(ii), (c)-(iv), (d)-(i)
(B) (a)-(ii), (b)-(iii), (c)-(iv), (d)-(i)
(C) (a)-(i), (b)-(ii), (c)-(iv), (d)-(iii)
(D) (a)-(i), (b)-(iii), (c)-(iv), (d)-(ii)


Answer: (B)

Explanation: BFS → O(b^d) worst case space complexity
DFS → O(bm) worst case space complexity
Depth – Limited Search → O(bl)
Iterative deepening Search → O(bd)

Option (B) is correct.

Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :