Scribd
Upload
12 views2 pages

Artificial Intelligence: Constraint Satisfaction Problems: Week 1 Assessment 1

The document discusses constraint satisfaction problems (CSPs). [1] CSPs involve formulating problems using variables and constraints. [2] A constraint restricts the values that variables can take. [3] To solve a CSP, values must be assigned to all variables such that all constraints are satisfied. [4] A binary CSP is one where each constraint involves two variables. [5] Hard constraints must necessarily hold, while soft constraints need not necessarily hold.

Uploaded by

Manem Yaswant
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
12 views2 pages

Artificial Intelligence: Constraint Satisfaction Problems: Week 1 Assessment 1

The document discusses constraint satisfaction problems (CSPs). [1] CSPs involve formulating problems using variables and constraints. [2] A constraint restricts the values that variables can take. [3] To solve a CSP, values must be assigned to all variables such that all constraints are satisfied. [4] A binary CSP is one where each constraint involves two variables. [5] Hard constraints must necessarily hold, while soft constraints need not necessarily hold.

Uploaded by

Manem Yaswant
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Artificial Intelligence: Constraint Satisfaction Problems

Week 1 Assessment 1 – Answers


Glossary: Constraint Satisfaction Problems (CSP)

1. CSPs are – [1 mark]


a. an alternative formulation for general problem solving method ß
b. ways of formulating problems using variables and constraints ß
c. problems that come in the way of satisfying constraints
d. problems that arise after constraint satisfaction
e. none of the above

2. A constraint is [1 mark]
a. something that prevents an algorithm from solving a problem.
b. a restriction on what values the variables in the problem can take. ß
c. a limitation of the problem solving approach.
d. none of the above.

3. Which of the following statements are true regarding solving a CSP? [1 mark]
a. Values must be assigned to ALL variables such that ALL constraints are satisfied. ß
b. Values must be assigned to at least SOME variables such that ALL constraints are satisfied.
c. Values must be assigned to ALL variables such that at least SOME constraints are satisfied.
d. Values must be assigned to at least SOME variables such that at least SOME constraints are
satisfied.

4. Which of the following conditions must hold for a solution to a CSP? [1 mark]
a. All relations in all constraints must hold.
b. At least one relation in all constraints must hold. ß
c. More than one relation in all constraints must hold.
d. All relations in at least one constraint must hold.
e. It is sufficient that at least one relation in at least one constraint holds.

5. A Binary CSP is [1 mark]


a. a CSP with only two variables.
b. a CSP where each variable can take only two values.
c. a CSP with only two constraints.
d. a CSP where the size of the scope of every constraint is two. ß

6. Which of the following statements are true regarding soft and hard constraints? [1 mark]
a. Every soft constraint must necessarily hold, while every hard constraint need not necessarily
hold.
b. Every soft constraint and hard constraint must necessarily hold.
c. Every hard constraint must necessarily hold, while every soft constraint need not necessarily
hold. ß
d. It is acceptable for most hard constraints to hold, but the number of hard constraints being
satisfied must be more than the number of soft constraints being satisfied.
7. Consider the following constraint network R = <{x1, x2, x3}, {D1, D2, D3}, {C}> where D1 = D2 = D3 = {a,
b, c} and C = <{x1, x2, x3}, {<a, a, b>, <a, b, b>, <b, a, c>, <b, b, b>}. How many solutions exist?
[1 mark]
Ans: 4

8. “A constraint can be viewed as a pair <S, R>, where S is the _____, and R is the relation.” Fill in the
blanks with a single word in lowercase. [1 mark]
Ans: scope

9. The Waltz algorithm is used to solve [1 mark]


a. N-Queens problem
b. Scheduling problem
c. Graph Colouring problem
d. Radio Link Frequency Assignment Problem
e. Crypto Arithmetic Puzzles
f. Crossword Puzzles
g. None of the above <

Given the following crypto-arithmetic puzzle.


GERALD
+ DONALD
ROBERT
10. The number of variables for which values have to be found in the network is _________. [1 mark]
(answer in numeric form)
Ans: 16

11. If a constraint D=5 is enforced, then ROBERT will be encoded as __________ . [2 marks]
(answer in numeric form)
Ans: 723970

You might also like