Which search technique is complete and optimal, when h(n) is consistent?

PYQ UGC NET 2022

Which search technique is complete and optimal, when h(n) is consistent?

  1. A.

    Best First Search

  2. B.

    Depth First Search

  3. C.

    A* Search

  4. D.

    Breadth First Search

Attempted by 35 students.

Sign up free to check your answer

Sign up free

Explore the full course: Nta Ugc Net Paper 2

Loading lesson…