Computer Science · Artificial Intelligence
उनकी सबसे खराब स्थिति की समय जटिलता (worst-case time complexity) पर विचार करते हुए सूची I को सूची II के साथ सुमेलित कीजिए (जहाँ b ब्रांचिंग फैक्टर है, d समाधान की गहराई है, m अधिकतम गहराई है): सूची I A. हिल क्लाइंबिंग (Hill climbing) B. बेस्ट-फर्स्ट सर्च (Best-first search) C. A* सर्च D. डेप्थ-फर्स्ट सर्च (Depth-first search) सूची II I. O(bd) II. O(bd) III. O(1) IV. O(bm) नीचे दिए गए विकल्पों में से सही उत्तर चुनिए:
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✓
सही उत्तर देखें
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