Computer Science · Artificial Intelligence
Match List I with List II considering their worst-case time complexities (where b is branching factor, d is depth of solution, m is maximum depth): List I A. Hill climbing B. Best-first search C. A* Search D. Depth-first search List II I. O(bd) II. O(bd) III. O(1) IV. O(bm) Choose the correct answer from the options given below:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1A - I, B - III, C - II, D - IV
- 2A - II, B - IV, C - I, D - III
- 3A - II, B - I, C - IV, D - III
- 4A - III, B - I, C - IV, D - II✓
Correct answer
A - III, B - I, C - IV, D - II
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