Quiz Space

AI: Search Methods for Problem Solving · Quiz 1 · 23 Feb 2025 · January 2025 term

AI Search Methods Quiz 1 23 Feb 2025 — Question 1

Question 1

+0 marksOne or more correct options

Select all that apply.

  1. A

    Printed graph sheets were provided on time.

  2. B

    Printed graph sheets were provided late.

  3. C

    Printed graph sheets were not provided.

  4. D

    I used the graph sheets.

  5. E

    I did not use graph sheets.

Show answer

Correct answers

  • A

    Printed graph sheets were provided on time.

  • D

    I used the graph sheets.

See the whole paperTake it as a mock test

Question 1 of 21 in the IIT Madras BS AI: Search Methods for Problem Solving (AI Search Methods) Quiz 1 paper sat on 23 Feb 2025, in the January 2025 term (IIT M DEGREE AN EXAM QDB2 23 Feb 2025). It carries 0 marks.

More questions from this paper

  1. Q2STATE SPACE\ Select the algorithms that find the shortest path (measured in number of hops).
  2. Q3STATE SPACE
  3. Q4STATE SPACE
  4. Q5SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  5. Q6SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  6. Q7SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  7. Q8SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  8. Q9SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  9. Q10SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  10. Q11SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  11. Q12SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  12. Q13Genetic Algorithm\ A tour of 10 cities is shown below. The edges are bi-directional. Use D, E, F,..., M as the referenc…
  13. Q14Genetic Algorithm\ A tour of 10 cities is shown below. The edges are bi-directional. Use D, E, F,..., M as the referenc…
  14. Q15Genetic Algorithm\ A tour of 10 cities is shown below. The edges are bi-directional. Use D, E, F,..., M as the referenc…
  15. Q16Genetic Algorithm\ A tour of 10 cities is shown below. The edges are bi-directional. Use D, E, F,..., M as the referenc…
  16. Q17TSP\ The distance matrix for 5 cities and corresponding edge costs (in ascending order) is provided below. Use this inf…
  17. Q18TSP\ The distance matrix for 5 cities and corresponding edge costs (in ascending order) is provided below. Use this inf…
  18. Q19TSP\ The distance matrix for 5 cities and corresponding edge costs (in ascending order) is provided below. Use this inf…
  19. Q20TSP\ The distance matrix for 5 cities and corresponding edge costs (in ascending order) is provided below. Use this inf…
  20. Q21TSP\ The distance matrix for 5 cities and corresponding edge costs (in ascending order) is provided below. Use this inf…