Computer Science · Artificial Intelligence
Which search algorithm can get trapped going deeper and deeper along an infinite path in an unbounded state space without reaching a solution?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1A* Search
- 2AO* Search
- 3Depth-First Search (DFS)✓
- 4Breadth-First Search (BFS)
Correct answer
Depth-First Search (DFS)
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