Question 3739 – Algorithms
November 26, 2023Question 4912 – Algorithms
November 26, 2023UGC NET CS 2018-DEC Paper-2
| 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
b= branch factor
d= depth of shallowest solution
M= Maximum depth of the search tree
I= depth limit
| (a)-(iii), (b)-(ii), (c)-(iv), (d)-(i) | |
| (a)-(ii), (b)-(iii), (c)-(iv), (d)-(i) | |
| (a)-(i), (b)-(ii), (c)-(iv), (d)-(iii) | |
| (a)-(i), (b)-(iii), (c)-(iv), (d)-(ii) |
Question 4 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)
Note: Based upon BFS and DFS we can find the solution.
DFS → O(bm) worst case space complexity
Depth- Limited Search → O(bl)
Iterative deepening Search → O(bd)
Note: Based upon BFS and DFS we can find the solution.
Correct Answer: B
Question 4 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)
Note: Based upon BFS and DFS we can find the solution.
DFS → O(bm) worst case space complexity
Depth- Limited Search → O(bl)
Iterative deepening Search → O(bd)
Note: Based upon BFS and DFS we can find the solution.