UGC/CBSE NET SOLVED QUESTION PAPERS.(Computer Science): Q31,p3,j14. Consider f(N) = g(N) + h(N) Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of additional cost of getting from the current node N to the goal node. Then f(N) = h(N) is used in which one of the following algorithms ?

Sunday 21 June 2015

Q31,p3,j14. Consider f(N) = g(N) + h(N) Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of additional cost of getting from the current node N to the goal node. Then f(N) = h(N) is used in which one of the following algorithms ?

(A) A* algorithm

(B) AO* algorithm

(C) Greedy best first search algorithm

(D) Iterative A* algorithm

Answer C

No comments:

Post a Comment

Note: only a member of this blog may post a comment.

Subscribe to: Post Comments (Atom)