[amp_mcq option1=”Lowest path cost” option2=”Heuristic cost” option3=”Highest path cost” option4=”Average path cost” correct=”option1″]
The correct answer is: A. Lowest path cost
Uniform-cost search is an algorithm for finding the shortest path between two nodes in a graph. It works by expanding the node with the lowest path cost first. The path cost is the sum of the heuristic cost and the actual cost. The heuristic cost is an estimate of the distance from the current node to the goal node. The actual cost is the distance from the current node to the next node in the path.
Here is a brief explanation of each option:
- Option A: Lowest path cost. This is the correct answer. Uniform-cost search expands the node with the lowest path cost first.
- Option B: Heuristic cost. The heuristic cost is an estimate of the distance from the current node to the goal node. Uniform-cost search does not use the heuristic cost to expand nodes.
- Option C: Highest path cost. This is the wrong answer. Uniform-cost search expands the node with the lowest path cost first, not the highest path cost.
- Option D: Average path cost. This is the wrong answer. Uniform-cost search does not use the average path cost to expand nodes.