UGC-NET | UGC NET CS 2018 Dec – II | Question 4

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

Article Tags :

UGC-NET

Recommended Articles

1. UGC-NET | UGC NET CS 2018 Dec – II | Question 27

2. UGC-NET | UGC NET CS 2018 Dec – II | Question 1

3. UGC-NET | UGC NET CS 2018 Dec – II | Question 2

4. UGC-NET | UGC NET CS 2018 Dec – II | Question 3

5. UGC-NET | UGC NET CS 2018 Dec – II | Question 5

6. UGC-NET | UGC NET CS 2018 Dec – II | Question 6

7. UGC-NET | UGC NET CS 2018 Dec – II | Question 7

8. UGC-NET | UGC NET CS 2018 Dec – II | Question 8

9. UGC-NET | UGC NET CS 2018 Dec – II | Question 9

10. UGC-NET | UGC NET CS 2018 Dec – II | Question 10

11. UGC-NET | UGC NET CS 2018 Dec – II | Question 11

12. UGC-NET | UGC NET CS 2018 Dec – II | Question 12

13. UGC-NET | UGC NET CS 2018 Dec – II | Question 13

14. UGC-NET | UGC NET CS 2018 Dec – II | Question 14

15. UGC-NET | UGC NET CS 2018 Dec – II | Question 15

16. UGC-NET | UGC NET CS 2018 Dec – II | Question 16

17. UGC-NET | UGC NET CS 2018 Dec – II | Question 17

18. UGC-NET | UGC NET CS 2018 Dec – II | Question 18

19. UGC-NET | UGC NET CS 2018 Dec – II | Question 19

20. UGC-NET | UGC NET CS 2018 Dec – II | Question 20

21. UGC-NET | UGC NET CS 2018 Dec – II | Question 21

22. UGC-NET | UGC NET CS 2018 Dec – II | Question 22

23. UGC-NET | UGC NET CS 2018 Dec – II | Question 23

24. UGC-NET | UGC NET CS 2018 Dec – II | Question 24

25. UGC-NET | UGC NET CS 2018 Dec – II | Question 25