Quiz Space

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

Question 1: Is it possible to construct a TSP tour by traversing only…

Question 1

+1 markOne correct option

Answer the given sub-questions based on the above problem using algorithms presented in the lectures.

Is it possible to construct a TSP tour by traversing only along the edges in the graph?

  1. A

    Yes.

  2. B

    No.

  3. C

    Cannot be determined.

Show answer

Correct answer

  • A

    Yes.

See the whole paperTake it as a mock test

Question 1 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. Q2What will be the size of the OPEN list when GoalTest returns true during Breadth First search? (Note: nodes already see…
  2. Q3What will be the cost of the path found by the A algorithm? Use Big-O notation. Answers Case Sensitive : No
  3. Q4The heuristic is .
  4. Q5What is the full form of DC BFHS? Answers Case Sensitive : No
  5. Q6GAMES\ Consider any k-ply game tree having MAX as root, where k is an ODD number, and each player having exactly 2 move…
  6. Q7Answers Case Sensitive : No
  7. Q8Let the SSS algorithm process the subtree with h=30, identify the leaf node(s) solved by the algorithm, and enter those…
  8. Q9PROBLEM DECOMPOSITION\ The figure shows an AND-OR decomposition of problem S into subproblems. The nodes are uniquely i…
  9. Q10PROBLEM 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^(k^2) blocks and k^2 arms, …
  18. Q19Given a valid planning problem, under what conditions will GraphPlan return a valid plan? Give a precise and concise an…
  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…