Question 21 : Hill-Climbing approach stuck for the following reasons
1. Local maxima
2. Ridges
3. Plateaux
4. All of the mentioned
View Answer   Discuss with Members

Question 22 : Hill climbing sometimes called ____________ because it grabs a good neighbor state without thinking ahead about where to go next.
1. Needy local search
2. Heuristic local search
3. Greedy local search
4. Optimal local search
View Answer   Discuss with Members

Question 23 : Stochastic hill climbing chooses at random from among the uphill moves; the probability of selection can vary with the steepness of the uphil1 move.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 24 : One of the main cons of hill-climbing search is,
1. Terminates at local optimum & Does not find optimum solution
2. Terminates at global optimum & Does not find optimum solution
3. Does not find optimum solution & Fail to find a solution
4. Fail to find a solution
View Answer   Discuss with Members

Question 25 : Hill-Climbing algorithm terminates when,
1. Stopping criterion met
2. Global Min/Max is achieved
3. No neighbor has higher value
4. All of the mentioned
View Answer   Discuss with Members

Question 26 : _______________ Is an algorithm, a loop that continually moves in the direction of increasing value - that is uphill
1. Up-Hill Search
2. Hill-Climbing
3. Hill algorithm
4. Reverse-Down-Hill search
View Answer   Discuss with Members

Question 27 : A complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximum. State whether True or False.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 28 : Though local search algorithms are not systematic, key advantages would include
1. Less memory
2. More time
3. Finds a solution in large infinite space
4. Less memory & Finds a solution in large infinite space
View Answer   Discuss with Members

Question 29 : In many problems the path to goal is irrelevant, this class of problems can be solved using,
1. Informed Search Techniques
2. Uninformed Search Techniques
3. Local Search Techniques
4. Informed & Uninformed Search Techniques
View Answer   Discuss with Members

Question 30 : A* is optimal if h(n) is an admissible heuristic-that is, provided that h(n) never underestimates the cost to reach the goal.
1. True
2. False
3.
4.
View Answer   Discuss with Members