Quiz Space

AI: Search Methods for Problem Solving · End Term · 10 May 2026 · January 2026 term · Set 2

Question 32: CONSTRAINT SATISFACTION Consider a CSP over 3 variables …

Question 32

+1 markOne correct option

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 n by d, for example, mod(8,3)=2, mod(6,7)=6, mod(8,7)=1. Compute the three relations to match the domain constraints,then draw the constraint graph and matching-diagram,and then answer the sub-questions.

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

If the given CSP is not already arc-consistent, then make it arc-consistent, and then check if the resulting network is path consistent.

  1. A

    It is path consistent.

  2. B

    It is not path consistent.

  3. C

    Path consistency does not apply because the constraint graph has a cycle.

Show answer

Correct answer

  • A

    It is path consistent.

See the whole paperTake it as a mock test

Question 32 of 42 in the IIT Madras BS AI: Search Methods for Problem Solving (AI Search Methods) End Term paper sat on 10 May 2026, in the January 2026 term (Ai: Search Methods For Problem Solving 06 May 26). It carries 1 mark.

More questions from this paper

  1. Q1Figure question
  2. Q2SEARCH Consider a water-jug puzzle with three jugs a, b and c of capacities 5L, 3L and 2L, respectively. A state, encod…
  3. Q3SEARCH Consider a water-jug puzzle with three jugs a, b and c of capacities 5L, 3L and 2L, respectively. A state, encod…
  4. Q4Under what cases does Depth First Iterative Deepening (DFID) guarantee to find the shortest path if one exists?
  5. Q5Given a finite state space with unit edge costs, and a heuristic function whose properties are not known, which of the …
  6. Q6If w is set to a large value (tending to infinity) then wA algorithm will .
  7. Q7GAMES: ALPHA-BETA Consider a game tree with the root node as MAX, where an arbitrary path from the root reaches the sub…
  8. Q8GAMES: ALPHA-BETA Consider a game tree with the root node as MAX, where an arbitrary path from the root reaches the sub…
  9. Q9GAMES: ALPHA-BETA Consider a game tree with the root node as MAX, where an arbitrary path from the root reaches the sub…
  10. Q10GAMES: ALPHA-BETA Consider a game tree with the root node as MAX, where an arbitrary path from the root reaches the sub…
  11. Q11GAMES: SSS STAR The figure shows a game tree with evaluation function values at the horizon nodes. The horizon nodes ar…
  12. Q12GAMES: SSS STAR The figure shows a game tree with evaluation function values at the horizon nodes. The horizon nodes ar…
  13. Q13PROBLEM DECOMPOSITION The figure shows an AND-OR decomposition of problem S into smaller problems. The nodes are unique…
  14. Q14PROBLEM DECOMPOSITION The figure shows an AND-OR decomposition of problem S into smaller problems. The nodes are unique…
  15. Q15PROBLEM DECOMPOSITION The figure shows an AND-OR decomposition of problem S into smaller problems. The nodes are unique…
  16. Q16RULE BASED EXPERT SYSTEMS A part of the Rete Net that classifies mushrooms (as edible or poisonous) is shown in the fig…
  17. Q17RULE BASED EXPERT SYSTEMS A part of the Rete Net that classifies mushrooms (as edible or poisonous) is shown in the fig…
  18. Q18RULE BASED EXPERT SYSTEMS A part of the Rete Net that classifies mushrooms (as edible or poisonous) is shown in the fig…
  19. Q19Consider actions a and b and the two orderings (a then b) and (b then a). Which of the following conditions (each taken…
  20. Q20In planning graphs constructed by GraphPlan, actions a and b in layer n are mutex .
  21. Q21In planning graphs constructed by GraphPlan, which of the following are true?
  22. Q22Allowed : No Group Comprehension Questions : No Question Pattern Type : NonMatrix AUTOMATED PLANNING 2 The domain descr…
  23. Q23Allowed : No Group Comprehension Questions : No Question Pattern Type : NonMatrix AUTOMATED PLANNING 2 The domain descr…
  24. Q24Allowed : No Group Comprehension Questions : No Question Pattern Type : NonMatrix AUTOMATED PLANNING 2 The domain descr…
  25. Q25Allowed : No Group Comprehension Questions : No Question Pattern Type : NonMatrix AUTOMATED PLANNING 2 The domain descr…
  26. Q26Allowed : No Group Comprehension Questions : No Question Pattern Type : NonMatrix AUTOMATED PLANNING 2 The domain descr…
  27. Q27Allowed : No Group Comprehension Questions : No Question Pattern Type : NonMatrix AUTOMATED PLANNING 2 The domain descr…
  28. Q28Allowed : No Group Comprehension Questions : No Question Pattern Type : NonMatrix AUTOMATED PLANNING 2 The domain descr…
  29. Q29CONSTRAINT SATISFACTION Consider a CSP over 3 variables A, B, C where the domains and constraints are: where, mod(n,d) …
  30. Q30CONSTRAINT SATISFACTION Consider a CSP over 3 variables A, B, C where the domains and constraints are: where, mod(n,d) …
  31. Q31CONSTRAINT SATISFACTION Consider a CSP over 3 variables A, B, C where the domains and constraints are: where, mod(n,d) …
  32. Q33CONSTRAINT SATISFACTION Consider a CSP over 3 variables A, B, C where the domains and constraints are: where, mod(n,d) …
  33. Q34SEARCH Consider a water-jug puzzle with three jugs a, b and c of capacities 5L, 3L and 2L, respectively. A state, encod…
  34. Q35SEARCH ALGORITHMS Answer the given subquestions.
  35. Q36GAMES: ALPHA-BETA Consider a game tree with the root node as MAX, where an arbitrary path from the root reaches the sub…
  36. Q37GAMES: SSS STAR The figure shows a game tree with evaluation function values at the horizon nodes. The horizon nodes ar…
  37. Q38PROBLEM DECOMPOSITION The figure shows an AND-OR decomposition of problem S into smaller problems. The nodes are unique…
  38. Q39RULE BASED EXPERT SYSTEMS A part of the Rete Net that classifies mushrooms (as edible or poisonous) is shown in the fig…
  39. Q40AUTOMATED PLANNING 1 Answer the given subquestions.
  40. Q41Allowed : No Group Comprehension Questions : No Question Pattern Type : NonMatrix AUTOMATED PLANNING 2 The domain descr…
  41. Q42CONSTRAINT SATISFACTION Consider a CSP over 3 variables A, B, C where the domains and constraints are: where, mod(n,d) …