Artificial Intelligence (2180703) MCQs
MCQs of Problems, State Space Search & Heuristic Search Techniques
| 41. |
What are the main cons of hill-climbing search?
|
||||||||
|
Answer:
Option (a) |
| 42. |
Stochastic hill climbing chooses at random from among the uphill moves; the probability of selection can vary with the steepness of the uphil1 move.
|
||||
|
Answer:
Option (a) |
| 43. |
Hill climbing sometimes called ____________ because it grabs a good neighbor state without thinking ahead about where to go next.
|
||||||||
|
Answer:
Option (c) |
| 44. |
Hill-Climbing approach stuck for which of the following reasons?
|
||||||||
|
Answer:
Option (d) |
| 45. |
_________________ are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations.
|
||||||||
|
Answer:
Option (a) |
| 46. |
Which of the Following problems can be modeled as Constraint Satisfaction Problem?
|
||||||||
|
Answer:
Option (d) |
| 47. |
What among the following constitutes to the incremental formulation of Constraint Satisfaction Problem?
|
||||||||
|
Answer:
Option (d) |
| 48. |
The term ___________ is used for a depth-first search that chooses values for one variable at a time and returns when a variable has no legal values left to assign.
|
||||||||
|
Answer:
Option (b) |
| 49. |
To overcome the need to backtrack in constraint satisfaction problem can be eliminated by ____________
|
||||||||
|
Answer:
Option (a) |
| 50. |
Consider a problem of preparing a schedule for a class of student. What type of problem is this?
|
||||||||
|
Answer:
Option (c) |
Developed by
