Explanation: In a heuristic approach, we discover certain idea and use heuristic functions to search for a goal and predicates to compare nodes. 2. A* algorithm is based on
A. Breadth-First-Search
B. Depth-First –Search
C. Best-First-Search
D. Hill climbing
Answer:A
Explanation: In a heuristic approach, we discover certain idea and use heuristic functions to search for a goal and predicates to compare nodes. 2. 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. 3. The search strategy the uses a problem specific knowledge is known as