Quiz Space

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

Question 10: PROBLEM DECOMPOSITION\ The figure shows an AND-OR decomp…

Question 10

+1 markOne correct option

PROBLEM DECOMPOSITION
The figure shows an AND-OR decomposition of problem S into subproblems. The nodes are uniquely identified by labels (S, A, B, C, …). Each node displays its heuristic cost, but primitive nodes (double border) display the actual cost. Primitive nodes attain SOLVED status when their parent is expanded, so primitive nodes are never expanded. The cost of each edge is 2 units.
Tie-breaker 1: If several nodes have the same cost then break the tie using node labels. Tie-breaker 2: For AND nodes, select the unsolved branch with the highest cost.

Use AO* algorithm to solve S, then answer the sub-questions.

Did AO* return the optimal solution for the given problem?

  1. A

    Yes

  2. B

    No

  3. C

    Cannot be determined

Show answer

Correct answer

  • B

    No

See the whole paperTake it as a mock test

Question 10 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. Q11RULE BASED EXPERT SYSTEMS\ A Rete Net for classification of properties is shown in the figure. The labels A1, A2, A3, .…
  11. Q12RULE BASED EXPERT SYSTEMS\ A Rete Net for classification of properties is shown in the figure. The labels A1, A2, A3, .…
  12. Q13RULE BASED EXPERT SYSTEMS\ A Rete Net for classification of properties is shown in the figure. The labels A1, A2, A3, .…
  13. Q14GOAL STACK PLANNING\ The domain description of Blocks World with a single one-armed robot is given below. Tie-breaker 1…
  14. Q15GOAL STACK PLANNING\ The domain description of Blocks World with a single one-armed robot is given below. Tie-breaker 1…
  15. Q16GRAPH-PLAN\ The domain description of Blocks World with a single one-armed robot is given below. The GraphPlan algorith…
  16. Q17GRAPH-PLAN\ The domain description of Blocks World with a single one-armed robot is given below. The GraphPlan algorith…
  17. Q18AUTOMATED PLANNING\ Consider a planning problem in the multiarm blocks-world domain, with 2^(2^k) blocks and 2^k arms, …
  18. Q19Given a planning problem, under what conditions will GraphPlan report that a plan does not exist? Give a precise and co…
  19. Q20Can GraphPlan solve the Sussman anomaly?
  20. Q21CONSTRAINT SATISFACTION\ Consider a CSP over 3 variables A, B, C, where the domains and constraints are: where, mod(n,d…
  21. Q22CONSTRAINT SATISFACTION\ Consider a CSP over 3 variables A, B, C, where the domains and constraints are: where, mod(n,d…
  22. Q23CONSTRAINT SATISFACTION\ Consider a CSP over 3 variables A, B, C, where the domains and constraints are: where, mod(n,d…
  23. Q24CONSTRAINT SATISFACTION\ Consider a CSP over 3 variables A, B, C, where the domains and constraints are: where, mod(n,d…
  24. Q25CONSTRAINT SATISFACTION\ Consider a CSP over 3 variables A, B, C, where the domains and constraints are: where, mod(n,d…