Quiz Space

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

Question 19: Consider actions a and b and two feasible orderings (a t…

Question 19

+1 markOne or more correct options

AUTOMATED PLANNING 1 Answer the given subquestions.

Consider actions a and b and two feasible orderings (a then b) and (b then a). Which of the following conditions (each taken independently) will produce different outcomes for each ordering?

Select all that apply.

  1. A

    P is in pre(a) and Q is in del-effects(b).

  2. B

    P is in add-effects(a) and also in del-effects(b).

  3. C

    None of these.

Show answer

Correct answers

  • A

    P is in pre(a) and Q is in del-effects(b).

  • B

    P is in add-effects(a) and also in del-effects(b).

See the whole paperTake it as a mock test

Question 19 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. Q4Which of the following variants of Depth First Iterative Deepening (DFID) is guaranteed to find the shortest path if on…
  5. Q5Given a finite state space with edge costs that may or may not be Euclidean and a heuristic function whose properties a…
  6. Q6If w is set to zero 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. Q20In planning graphs constructed by GraphPlan, actions a and b in layer n are mutex .
  20. Q21In planning graphs constructed by GraphPlan, which of the following are true?
  21. Q22AUTOMATED PLANNING 2 The domain description of a Blocks World with a single one-armed robot is given below. Consider th…
  22. Q23AUTOMATED PLANNING 2 The domain description of a Blocks World with a single one-armed robot is given below. Consider th…
  23. Q24AUTOMATED PLANNING 2 The domain description of a Blocks World with a single one-armed robot is given below. Consider th…
  24. Q25AUTOMATED PLANNING 2 The domain description of a Blocks World with a single one-armed robot is given below. Consider th…
  25. Q26AUTOMATED PLANNING 2 The domain description of a Blocks World with a single one-armed robot is given below. Consider th…
  26. Q27AUTOMATED PLANNING 2 The domain description of a Blocks World with a single one-armed robot is given below. Consider th…
  27. Q28AUTOMATED PLANNING 2 The domain description of a Blocks World with a single one-armed robot is given below. Consider th…
  28. Q29CONSTRAINT SATISFACTION Consider a CSP over 3 variables A, B, C where the domains and constraints are: where, mod(n,d) …
  29. Q30CONSTRAINT SATISFACTION Consider a CSP over 3 variables A, B, C where the domains and constraints are: where, mod(n,d) …
  30. Q31CONSTRAINT SATISFACTION Consider a CSP over 3 variables A, B, C where the domains and constraints are: where, mod(n,d) …
  31. Q32CONSTRAINT 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. Q41AUTOMATED PLANNING 2 The domain description of a Blocks World with a single one-armed robot is given below. Consider th…
  41. Q42CONSTRAINT SATISFACTION Consider a CSP over 3 variables A, B, C where the domains and constraints are: where, mod(n,d) …