Quiz Space

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

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

Question 25

+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.

The Waltz Algorithm __________

Select all that apply.

  1. A

    can process 2D drawings showing cracks and shadows

  2. B

    can process vertices with more than 3 edges

  3. C

    cannot process objects with cracks and shadows

  4. D

    can only process trihedral objects without cracks or shadows

  5. E

    can detect and remove cracks and shadows from the 2D line drawing

  6. F

    runs in time proportional to log(Edge Count) + log(Vertex Count)

Show answer

Correct answers

  • A

    can process 2D drawings showing cracks and shadows

  • B

    can process vertices with more than 3 edges

  • E

    can detect and remove cracks and shadows from the 2D line drawing

See the whole paperTake it as a mock test

Question 25 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.

More questions from this paper

  1. Q1SEARCH\ A finite 2D plane of square shape has each side of length (D) exactly equal to 100 trillion trillion trillion t…
  2. Q2SEARCH\ A finite 2D plane of square shape has each side of length (D) exactly equal to 100 trillion trillion trillion t…
  3. Q3SEARCH\ A finite 2D plane of square shape has each side of length (D) exactly equal to 100 trillion trillion trillion t…
  4. Q4SEARCH\ A finite 2D plane of square shape has each side of length (D) exactly equal to 100 trillion trillion trillion t…
  5. Q5SEARCH\ A finite 2D plane of square shape has each side of length (D) exactly equal to 100 trillion trillion trillion t…
  6. Q6GAMES\ Consider any k-ply game tree having MAX as root, where k is an EVEN number, and each player having exactly 2 mov…
  7. Q7Let the AlphaBeta algorithm process the subtree with alpha=60 and beta=80, identify the leaf node(s) explored by the al…
  8. Q8Let the SSS algorithm process the subtree with h=20, identify the leaf node(s) that never made it to the queue, and ent…
  9. Q9PROBLEM DECOMPOSITION\ The figure shows an AND-OR decomposition of problem S into subproblems. The nodes are uniquely i…
  10. Q10PROBLEM DECOMPOSITION\ The figure shows an AND-OR decomposition of problem S into subproblems. The nodes are uniquely i…
  11. Q11RULE BASED EXPERT SYSTEMS\ A Rete Net for classification of properties is shown in the figure. The labels A1, A2, A3, .…
  12. Q12RULE BASED EXPERT SYSTEMS\ A Rete Net for classification of properties is shown in the figure. The labels A1, A2, A3, .…
  13. Q13RULE BASED EXPERT SYSTEMS\ A Rete Net for classification of properties is shown in the figure. The labels A1, A2, A3, .…
  14. Q14GOAL STACK PLANNING\ The domain description of Blocks World with a single one-armed robot is given below. Tie-breaker 1…
  15. Q15GOAL STACK PLANNING\ The domain description of Blocks World with a single one-armed robot is given below. Tie-breaker 1…
  16. Q16GRAPH-PLAN\ The domain description of Blocks World with a single one-armed robot is given below. The GraphPlan algorith…
  17. Q17GRAPH-PLAN\ The domain description of Blocks World with a single one-armed robot is given below. The GraphPlan algorith…
  18. Q18AUTOMATED PLANNING\ Consider a planning problem in the multiarm blocks-world domain, with 2^(2^k) blocks and 2^k arms, …
  19. Q19Given a planning problem, under what conditions will GraphPlan report that a plan does not exist? Give a precise and co…
  20. Q20Can GraphPlan solve the Sussman anomaly?
  21. Q21CONSTRAINT SATISFACTION\ Consider a CSP over 3 variables A, B, C, where the domains and constraints are: where, mod(n,d…
  22. Q22CONSTRAINT SATISFACTION\ Consider a CSP over 3 variables A, B, C, where the domains and constraints are: where, mod(n,d…
  23. Q23CONSTRAINT SATISFACTION\ Consider a CSP over 3 variables A, B, C, where the domains and constraints are: where, mod(n,d…
  24. Q24CONSTRAINT SATISFACTION\ Consider a CSP over 3 variables A, B, C, where the domains and constraints are: where, mod(n,d…