Aspire's Library
A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations - NIMCET
Study Stuff for MCA Examinations - NIMCET
Previous Year Question (PYQs)
Match List I with List II.
Choose the correct answer from the options given below:
| List I | List II |
|---|---|
| (A) Greedy Best-First Search | (I) Space complexity is $O(d)$ where $d$ is 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 the optimal solution is reachable; otherwise, returns the best reachable optimal solution. |
| (D) $SMA^*$ | (IV) Computation and space complexity are too high. |
Solution
Greedy Best-First Search selects the node that appears closest to the goal according to heuristic value.It may get trapped and can be incomplete even if the search space is finite.
So, (A) matches with II.
$A^*$ search is optimal and complete under proper conditions, but its computation and space complexity are very high because it stores many generated nodes.
So, (B) matches with IV.
Recursive Best-First Search uses limited memory and its space complexity is linear in depth.
So, (C) matches with I.
$SMA^*$ means Simplified Memory-Bounded $A^*$.
It is optimal if the optimal solution is reachable within available memory; otherwise, it returns the best reachable solution.
So, (D) matches with III.
Final matching is:
A-II, B-IV, C-I, D-III
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
Ask Your Question or Put Your Review.
