Explanation: Refer the definition of Hill-Climbing approach. 5. Hill-Climbing algorithm terminates when,
A. Stopping criterion met
B. Global Min/Max is achieved
C. No neighbor has higher value
D. Local Min/Max is achieved
Answer:A
Explanation: Refer the definition of Hill-Climbing approach. 5. Hill-Climbing algorithm terminates when,
A. Stopping criterion met B. Global Min/Max is achieved C. No neighbor has higher value D. Local Min/Max is achieved
Explanation: When no neighbor is having higher value, algorithm terminates fetching local min/max. 6. One of the main cons of hill-climbing search is,