UGC NET Computer Science December 2019 | Question 130

Question 130

---

Consider the following :
(a) Trapping at local maxima
(b) Reaching a plateau
(c) Traversal along the ridge.
Which of the following option represents shortcomings of the hill climbing algorithm?

1. 1. (a) and (b) only
2. 2. (a) and (c) only
3. 3. (b) and (c) only
4. 4. (a), (b) and (c)

Answer : 4. (a), (b) and (c)

Explanation Question 108

Problems in Hill Climbing Algorithm:

1. Local Maximum: A local maximum is a peak state in the landscape which is better than each of its neighboring states, but there is another state also present which is higher than the local maximum.
   Solution: Backtracking technique can be a solution of the local maximum in state space landscape. Create a list of the promising path so that the algorithm can backtrack the search space and explore other paths as well.
2. Plateau: A plateau is the flat area of the search space in which all the neighbor states of the current state contains the same value, because of this algorithm does not find any best direction to move. A hill-climbing search might be lost in the plateau area.
   Solution: The solution for the plateau is to take big steps or very little steps while searching, to solve the problem. Make a big jump. Randomly select a state far away from the current state. Chances are that we will land at a non-plateau region
3. Ridges: A ridge is a special form of the local maximum. It has an area which is higher than its surrounding areas, but itself has a slope, and cannot be reached in a single move.
   Solution: With the use of bidirectional search, or by moving in different directions, we can improve this problem.

Reference 1 : Problems in Hill Climbing Algorithm in AI

(a), (b), (c) all are shortcomings of the hill climbing algorithm.

So, option 4 is correct answer

Previous	Next
UGC NET CS December 2019 - Question 129	UGC NET CS December 2019 - Question 131