Question 1
Printed graph sheets were provided to me.`
Printed graph sheets were not provided to me.
I did not use graph sheets.
Question 2
STATE SPACE
One needs to count the number of nodes visited in each cycle of DFID __________ .
to compute the complexity of search
to make sure that the path returned is the shortest
to prevent the algorithm from getting into an infinite loop on an INFINITE graph when a goal node exists in the connected component
to prevent the algorithm from getting into an infinite loop on a FINITE graph when the goal node does not exist in the connected component
Question 3
STATE SPACE
In the Ant Colony Optimisation algorithm for solving the TSP __________ .
all the ants in the colony start from the same start city and then go in different directions
all ants construct the solution using a collaborative filtering approach
each ant constructs a tour independently
each ant constructs a tour using follow the leader principle
18 more questions in this paper
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.
More on the AI Search Methods Quiz 1 25 Feb 2024 paper
The IIT Madras BS AI: Search Methods for Problem Solving (AI Search Methods) Quiz 1 paper sat on 25 Feb 2024, in the January 2024 term: 21 questions for 25 marks in 120 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 Quiz 1 25 Feb 2024 at a glance |
|---|---|
| Term | January 2024 term |
| Subject | AI: Search Methods for Problem Solving |
| Course code | BSCS3003 |
| Questions | 21 |
| Marks | 25 |
| Duration | 120 min |
| MCQ | 4 |
| MSQ | 3 |
| Written | 12 |
| Numerical | 2 |
| Official paper | IIT M DEGREE AN2 EXAM QDB2 25 Feb 2024 |
| Negative marking | No negative marking. |
| Updated |