Computer Science · Artificial Intelligence
Match List-I with List-II: List I (A) Breadth-First Search (B) Depth-First Search (C) A* (with admissible h) (D) Greedy Best-First List II (I) Uses f(n) = g(n) + h(n); optimal with admissible h (II) Complete & optimal for unit step costs; time/space Θ(bd) (III) Linear space; may fail on infinite depth (IV) Uses f(n) = h(n); can be incomplete
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1A - II, B - III, C - I, D - IV✓
- 2A - III, B - II, C - IV, D - I
- 3A - I, B - IV, C - II, D - III
- 4A - IV, B - I, C - III, D - II
Correct answer
A - II, B - III, C - I, D - IV
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