A heuristic is a way of trying……….
a) To discover something or an idea embedded in a program
b) To search and measure how far a node in a search tree seems to be from a goal
c) To compare two nodes in a search tree to see if one is better than another
d) All of these
Explanation: In a heuristic approach, we discover certain idea and use heuristic functions to search for a goal and predicates to compare nodes.
A* algorithm is based on………..
a) Breadth-First-Search
b) Depth-First –Search
c) Best-First-Search
d) Hill climbing
Explanation: Best-first-search is giving the idea of optimization and quick choose of path, and all these characteristic lies in A* algorithm.
The search strategy the uses a problem specific knowledge is known as……..
a) Informed Search
b) Best First Search
c) Heuristic Search
d) All of these
Explanation: The problem specific knowledge is also known as Heuristics and Best-First search uses some heuristic to choose the best node for expansion.
Uninformed search strategies are better than informed search strategies.
a) True
b) False
Explanation: Informed search strategies uses some problem specific knowledge, hence more efficient to finding goals.
Best-First search can be implemented using the following data structure.
a) Queue
b) Stack
c) Priority Queue
d) Circular Queue
Explanation: Best-first search can be implemented within our general search framework via a priority queue, a data structure that will maintain the fringe in ascending order of f-values.
Heuristic function h(n) is……..
a) Lowest path cost
b) Cheapest path from root to goal node
c) Estimated cost of cheapest path from root to goal node
d) Average path cost
Explanation: Heuristic is an estimated cost.
