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