Q14.Marks: +2.0UGC NET Paper 2: Computer Science 7th Dec 2023 Shift 2
Match List-I with List-II
List I
List II
A.
Greedy Best first search
I.
The space complexity as O(d) where d = depth of the deepest optimal solution
B.
A*
II.
Incomplete even if the search space is finite
C.
Recursive best first search
III.
Optimal if optimal solution is reachable otherwise return the best reachable optimal solution
D.
SMA*
IV.
Computation and space complexity is two light
Choose the correct answer from the options given below :
1.A - II, B - IV, C - I, D - III✓ Correct
2.A - II, B - III, C - I, D - IV
3.A - III, B - II, C - IV, D - I
4.A - III, B - IV, C - II, D - I
Solution
The correct answer is A - II, B - IV, C - I, D - III
EXPLANATION:
A. Greedy Best-First Search (List I: A, List II: II)
Greedy Best-First Search uses heuristic information to select the most promising path. It evaluates nodes based on a heuristic function without considering the entire path cost. Incomplete even if the search space is finite.
B. A* (List I: B, List II: IV)
A* is a search algorithm that uses both the cost to reach a node and an estimate of the remaining cost to the goal (heuristic). It is optimal if the heuristic is admissible (never overestimates the true cost) and consistent. Computation and space complexity is two light (too high).
C. Recursive Best-First Search (List I: C, List II: I)
Recursive Best-First Search is a variation of Best-First Search that uses recursion. The space complexity as O(d) where d = depth of the deepest optimal solution
D. SMA* (List I: D, List II: III)
SMA* (Simplified Memory-Bounded A*) is a variant of A* that limits its memory usage. It returns the best reachable solution within the memory constraints. Optimal if optimal solution is reachable otherwise return the best reachable optimal solution
So, the correct match is: A - II, B - IV, C - I, D - III (Option 1)
Mistake Points Official question was some typing mistake List II option IV written "two light" but there should be "too high"
