Computer Science · Artificial Intelligence
Which of the following statements regarding search algorithms in Artificial Intelligence is FALSE?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1h(n) = 0 is an admissible heuristic for the 8- puzzle.
- 2Recursive best-first search is efficient in terms of time complexity but poor in terms of space complexity.✓
- 3A* is complete and optimal provided h(n) is admissible or consistent.
- 4Greedy best-first search is not optimal but is often efficient.
Correct answer
Recursive best-first search is efficient in terms of time complexity but poor in terms of space complexity.
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