Quiz Space

AI: Search Methods for Problem Solving · End Term · 1 Sept 2024 · May 2024 term · Set QDB3

Question 15: PROBLEM DECOMPOSITION List the first three nodes (includ…

Question 15

+1 markWritten answer

PROBLEM DECOMPOSITION

List the first three nodes (including S) expanded by AO* algorithm. List the nodes in the order they are expanded. Observe that primitive nodes are not expanded.
Enter a comma separated list of node labels.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: X,Y,Z

Show answer

Correct answer: S,A,C or A,C,B

See the whole paperTake it as a mock test

Question 15 of 26 in the IIT Madras BS AI: Search Methods for Problem Solving (AI Search Methods) End Term paper sat on 1 Sept 2024, in the May 2024 term (IIT M DEGREE FN EXAM QDB1 01 Sep 2024). It carries 1 mark.

More questions from this paper

  1. Q1ASK FOR PRINTED GRAPH SHEETS 10 PAGES DOUBLE-SIDED
  2. Q2What is the path found by the Best First Search algorithm? Enter the path as a comma separated list of node labels.\ NO…
  3. Q3What is the path found by A search algorithm? Enter the path as a comma separated list of node labels.\ NO SPACES, TABS…
  4. Q4What is the path found by Branch-and-Bound search algorithm? Enter the path as a comma separated list of node labels.\ …
  5. Q5For the given map, which algorithm finds the shortest path from S to G?
  6. Q6What can you say about the heuristic function for the given graph?
  7. Q7TSP Branch-and-Bound Let S0 (ref. no. a1) be the first node to be refined, identify the next 4 nodes (2nd to 5th node) …
  8. Q8TSP Branch-and-Bound Which node represents the optimal tour and what is the cost of the optimal tour? Enter the node re…
  9. Q9TSP Branch-and-Bound Determine the number of cities in the TSP instance. Enter the number of cities in the text box, or…
  10. Q10TSP Branch-and-Bound Start from city A, what is the path representation of the optimal tour? Enter the path\ representa…
  11. Q11Which of the following is a strategy for the MAX player?
  12. Q12List the leaf nodes in the best strategy for MAX. Enter the node labels in alphabetical order. Enter a comma separated …
  13. Q13List the leaf nodes pruned by Alpha-Beta.\ Enter a comma separated list of node labels in alphabetical order.\ NO SPACE…
  14. Q14List the leaf nodes solved (assigned SOLVED status) by SSS.\ Enter a comma separated list of node labels in alphabetica…
  15. Q16PROBLEM DECOMPOSITION Determine the value of the start node S after each node is expanded. What are the values of S aft…
  16. Q17PROBLEM DECOMPOSITION What is the final value of the start node S?\ Enter a number.\ NO SPACES, TABS, DOTS, BRACKETS OR…
  17. Q18RULE BASED EXPERT SYSTEMS Which of the following rule-data tuples are in the conflict-set?
  18. Q19RULE BASED EXPERT SYSTEMS If the Inference Engine uses Specificity as the conflict resolution strategy then which of th…
  19. Q20RULE BASED EXPERT SYSTEMS If the Inference Engine uses Recency as the conflict resolution strategy then which of the fo…
  20. Q21AUTOMATED PLANNING Based on the above data, answer the given subquestions. Which of the following are applicable action…
  21. Q22AUTOMATED PLANNING Based on the above data, answer the given subquestions. Which of the following are relevant actions …
  22. Q23AUTOMATED PLANNING Based on the above data, answer the given subquestions. In the planning graph, which of the followin…
  23. Q24AUTOMATED PLANNING Based on the above data, answer the given subquestions. In the planning graph, which of the followin…
  24. Q25CONSTRAINT SATISFACTION\ The set of junctions (L, W, Y and T type junctions) that occur in a 2D line drawing of trihedr…
  25. Q26CONSTRAINT SATISFACTION\ The set of junctions (L, W, Y and T type junctions) that occur in a 2D line drawing of trihedr…