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 4

Question 4

+1 markOne or more correct options

STATE SPACE

Select all that apply.

  1. A

    Every move is reversible.

  2. B

    There is at least one move that is not reversible.

  3. C

    There is a path from every state to every other state.

  4. D

    Every state has two neighbours.

Show answer

Correct answers

  • A

    Every move is reversible.

  • C

    There is a path from every state to every other state.

  • D

    Every state has two neighbours.

See the whole paperTake it as a mock test

Question 4 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 1 mark.

More questions from this paper

  1. Q1Figure question
  2. Q2STATE SPACE\ Select the algorithms that find the shortest path (measured in number of hops).
  3. Q3STATE 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…