Question 1
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?
Yes.
No.
Cannot be determined.
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?
Yes.
No.
Cannot be determined.
Answer the given sub-questions based on the above problem using algorithms presented in the lectures.
What will be the size of the OPEN list when GoalTest returns true during Breadth First search? (Note: nodes already seen are not reopened.) Answers Case Sensitive : Yes
Answer the given sub-questions based on the above problem using algorithms presented in the lectures.
What will be the cost of the path found by the A* algorithm? Use Big-O notation. Answers Case Sensitive : No
Sign in with Google — it is free — to see every question with its answer and explanation, practise it in learning mode, or take it as a timed mock test.
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, set S2: 25 questions for 25 marks in 180 minutes. The first 3 questions are below. Sign in with Google — it is free — to see the whole paper with its answers and explanations, in learning mode or as a timed mock test.
| Feature | AI Search Methods End Term 13 Sept 2026 Set S2 at a glance |
|---|---|
| Term | May 2026 term |
| Subject | AI: Search Methods for Problem Solving |
| Course code | BSCS3003 |
| Questions | 25 |
| Marks | 25 |
| Duration | 180 min |
| MCQ | 5 |
| Written | 17 |
| Numerical | 2 |
| MSQ | 1 |
| Official paper | Ai: Search Methods For Problem Solving 13 Sep 26 (Session 2) |
| Negative marking | No negative marking. |
| Updated |