GATE 2026 DA – Question 13
Which of the following algorithms is NOT an example of uninformed search?
Practise this question in The GATE Grind →
Show answer and explanation
Correct answer: (C) A* Search
Explanation
Uninformed (blind) search uses only the problem definition and no estimate of the distance to the goal. Breadth first, depth first and depth-limited search are all of that kind. A* search uses a heuristic estimate of the remaining cost, so it is an informed search.