IAE Academy

GATE 2026 DA Q.13: solution and answer

GATE 2026 · DAQ.13 · 1 mark · MCQ

Which of the following algorithms is NOT an example of uninformed search?

  1. (A)

    Breadth First Search

  2. (B)

    Depth First Search

  3. (C)

    A* Search

  4. (D)

    Depth-limited Search

See the question in the paper
GATE 2026 DA question 13Tap to open full size

Answer and solution

ANSWER

The answer is (C) A* Search, because it is the only informed (heuristic) search among the options.

Official answer: CSource: Official answer key, GATE 2026 DA (IIT Guwahati)

  1. Uninformed (blind) search uses only the problem definition: the start state, the successor function and the goal test. It has no estimate of how far a state is from the goal.

  2. Breadth First Search expands nodes level by level using only the graph structure, so it is uninformed.

  3. Depth First Search expands the deepest node first, again with no goal-distance information, so it is uninformed.

  4. Depth-limited Search is Depth First Search with a fixed depth cutoff, so it is also uninformed.

  5. A* Search orders the frontier by . The heuristic estimates the remaining cost to the goal, so A* is an informed (heuristic) search. It is therefore the one algorithm that is NOT uninformed, which is option (C).

KEY IDEA

Uninformed search uses no goal-distance estimate. Only a heuristic , as in for A*, makes a search informed.

WATCH OUT FOR

Misreading the question: it asks which algorithm is NOT uninformed, so the answer is the informed one. Choosing a blind search such as DFS answers the opposite question.

From the GATE 2026 DA paper. Every question of this paper · Download the full paper · All 7 Search questions, with notes

More Search questions