AI: Search Methods for Problem Solving · End Term · 13 Sept 2026 · May 2026 term · Set 1

Question 23: CONSTRAINT SATISFACTION\ Consider a CSP over 3 variables…

Question 23

+1 markOne or more correct options

CONSTRAINT SATISFACTION
Consider a CSP over 3 variables A, B, C, where the domains and constraints are:

where, mod(n,d) returns the remainder after dividing integer n by integer d, for example, mod(8,3)=2, mod(12,3)=0, mod(16,3)=1.
Compute the three constraints such that the values are from respective domains, draw the constraint graph and matching-diagram, then answer the sub-questions.

In the given CSP, constraints are defined between every pair of variables. But in general, for Binary CSPs of n variables, if the number of binary constraints is less than nC2 then __________ .

Select all that apply.

A
that network can be solved
B
that network cannot be solved
C
that network may or may not have a solution
D
that network will always have a solution
E
that network will never have a solution

Show answer

Correct answers

A
that network can be solved
C
that network may or may not have a solution

See the whole paper Take it as a mock test

Question 23 of 25 in the IIT Madras BS AI: Search Methods for Problem Solving (AI Search Methods) End Term paper sat on 13 Sept 2026, in the May 2026 term (Ai: Search Methods For Problem Solving 13 Sep 26 (Session 2)). It carries 1 mark.

Question 23: CONSTRAINT SATISFACTION\ Consider a CSP over 3 variables…

Question 23

More questions from this paper