Computer Science · Artificial Intelligence
Match List I with List II: List I (Search Algorithm) A. Greedy Best-first search B. A* search C. Recursive best-first search D. SMA* List II (Property) I. The space complexity is O(d) where d = depth of the deepest optimal solution II. Incomplete even if the search space is finite III. Optimal if optimal solution is reachable, otherwise returns the best reachable solution IV. Computation and space complexity is too light Choose the correct answer from the options given below:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1A - III, B - IV, C - II, D - I
- 2A - III, B - II, C - IV, D - I
- 3A - II, B - III, C - I, D - IV
- 4A - II, B - IV, C - I, D - III✓
Correct answer
A - II, B - IV, C - I, D - III
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Artificial Intelligence MCQs →Want more practice questions on Artificial Intelligence?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Artificial Intelligence