What are the main cons of hill-climbing search? – McqOptions

MCQOPTIONS

1.	What are the main cons of hill-climbing search?
A.	Terminates at local optimum & Does not find optimum solution
B.	Terminates at global optimum & Does not find optimum solution
C.	Does not find optimum solution & Fail to find a solution
D.	Fail to find a solution
Answer» B. Terminates at global optimum & Does not find optimum solution

Discussion

No Comment Found

Related MCQs

What are the two main features of Genetic Algorithm?
Hill-Climbing approach stuck for which of the following reasons?
What are the main cons of hill-climbing search?
When will Hill-Climbing algorithm terminate?
_______________ Is an algorithm, a loop that continually moves in the direction of increasing value that is uphill.
A complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximum.
Though local search algorithms are not systematic, key advantages would include __________
In many problems the path to goal is irrelevant, this class of problems can be solved using ____________