Quiz Space

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

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 given 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 and shadows

  5. E

    can 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 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. Q1Is it possible to construct a TSP tour by traversing only along the edges in the graph?
  2. Q2What will be the size of the OPEN list when GoalTest returns true during Breadth First search? (Note: nodes already see…
  3. Q3What will be the cost of the path found by the A algorithm? Use Big-O notation. Answers Case Sensitive : No
  4. Q4The heuristic is .
  5. Q5What is the full form of DC BFHS? Answers Case Sensitive : No
  6. Q6GAMES\ Consider any k-ply game tree having MAX as root, where k is an ODD number, and each player having exactly 2 move…
  7. Q7Answers Case Sensitive : No
  8. Q8Let the SSS algorithm process the subtree with h=30, identify the leaf node(s) solved by the algorithm, and enter those…
  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^(k^2) blocks and k^2 arms, …
  19. Q19Given a valid planning problem, under what conditions will GraphPlan return a valid plan? Give a precise and concise an…
  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…