1) What do the Constraints refer to in a CSP (Constraint Satisfactory problem)?
- Restrictions
- Rules
- Regulations
- All of the above
Correct answer: 4
All of the above
The constraint is the collection of all the restrictions and regulations that are imposed on the agent while solving the problem. The Agent cannot violate or avoid these restrictions while performing any action.
2) Which of the following mentioned problems are CSP (Constraint Satisfactory Problems)?
- N queens Problem
- Crypt- arithmetic problem
- Map coloring problem
- Sudoku
Options:
- Only iv.
- All i., ii., iii. and iv.
- ii. and iv.
- None of the above
Correct answer: 2
All i., ii., iii. and iv.
All the mentioned problems are examples of CSP (Constraint Satisfactory problem) in AI.
4) Consider the following statement:
"While solving a CSP (Constraint Satisfactory Problem), the agent cannot violate any of the rules and regulations or disobey the restrictions mentioned as the constraints."
Which of the following problems do not fall under the category of CSP?
- N- Queens Problem
- Chess
- Sudoku
- None of the above
Correct answer: 4
None of the above
In all the mentioned problems (or games) there are a set of constraints defined and the agent is bounded to follow the rules. Therefore, none of the mentioned problems fall apart from CSV.
5) Consider the following statement:
"In AI, CSP are mathematical questions defined as a set of the object whose state must satisfy a number constraint or limitation."
State whether the above condition is true or false?
- True
- False
Correct answer: 1
True
The given definition is the actual definition of the Constraint Satisfactory Problem (CSP) and hence is true.