Question

_________________ are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations.

Select one:

a. Constraints Satisfaction Problems

b. Uninformed Search Problems

c. Local Search Problems

d. None of these options

Answer 1

Ans: (a) Constraint Satisfaction Problem

For a Constraint Satisfaction Problem, we have a set of states where each state has to satisfy some constraints (rules)

For example: coloring problem

For a coloring problem we have set of states (places). We have to color each place such that no two adjacent colors have the same color.

Here the constraint is "no two adjacent states should have same color".

And Uniformed search and local search are search problems where we concentrate more on Searching only not on constraints.