adplus-dvertising
31. A* Search Algorithm _______________.
a. does not expand the node which have the lowest value of f(n),
b. finds the shortest path through the search space using the heuristic function i.e f(n)=g(n) + h(n)
c. terminates when the goal node is not found.
d. all of the above
Answer: (b).finds the shortest path through the search space using the heuristic function i.e f(n)=g(n) + h(n)

32. Which is not problem in Hill climing?
a. plateau
b. ridges
c. local maximum
d. landscape
Answer: (d).landscape

33. Tabu search is designed __________________________.
a. as it does not follow aspiration criteria
b. to escape the trap of local optimality.
c. to unrecord forbidden moves, which are referred to as tabu moves .
d. all of the above
Answer: (b).to escape the trap of local optimality.

Page 4 of 4