AALL10 · Chapter 10Basic Electrical & Electronics🏛️ Past Licensure QuestionID: 5072ffd3
What is the evaluation function f(n) in the A* search algorithm?
What is the evaluation function f(n) in the A* search algorithm?
Multiple Choice Options
- A
Heuristic function
- B
Path cost from start node to current node
- C✓ Correct Option
Path cost from start node to current node + Heuristic cost
- D
Average of Path cost from start node to current node and Heuristic cost
Detailed Technical Solution & Explanation
In the A* heuristic search algorithm, the total evaluation function is defined as , where is the exact accumulated path cost from the start node to the current node , and is the estimated heuristic cost to reach the goal from .
Option Analysis:
•
Option A (Heuristic function): Incorrect. Using only corresponds to Greedy Best-First Search.
•
Option B (Path cost from start node to current ...): Incorrect. Using only corresponds to Uniform Cost Search (Dijkstra's algorithm).
•
Option C (Path cost from start node to current ...): Correct. A* strictly minimizes .
•
Option D (Average of Path cost from start node ...): Incorrect.
Reference: Mock Test 01NEC Licensure Syllabus