Explanation: O(bm) is the space complexity where b is the branching factor and m is the maximum depth of the search tree. Since this algorithm resembles the DFS. 4. In A* approach evaluation function is
A. Heuristic function
B. Path cost from start node to current node
C. Path cost from start node to current node + Heuristic cost
D. Average of Path cost from start node to current node and Heuristic cost
Answer:A
Explanation: O(bm) is the space complexity where b is the branching factor and m is the maximum depth of the search tree. Since this algorithm resembles the DFS. 4. In A* approach evaluation function is
A. Heuristic function B. Path cost from start node to current node C. Path cost from start node to current node + Heuristic cost D. Average of Path cost from start node to current node and Heuristic cost
Explanation: The most widely-known form of best-first search is called A* search. It evaluates nodes by combining g(n),t he cost to reach the node, and h(n.), the cost to get from the node to the goal: f(n) = g(n) + h(n). Since g(n) gives the path cost from the start node to node n, and h(n) is the estimated cost of the cheapest path from n to the goal. 5. A* is optimal if h(n) is an admissible heuristic-that is, provided that h(n) never underestimates the cost to reach the goal.