Quiz Space

AI: Search Methods for Problem Solving · Quiz 1 · 19 Jul 2026 · May 2026 term

Question 18: If you initially implement Breadth-First Search using Fi…

Question 18

+1 markOne correct option

ALGORITHMS
Answer the given subquestions.

If you initially implement Breadth-First Search using First-In-First-Out Queue and later replace the queue with Max-Priority Queue based on node depth (larger depth equals higher priority), then the memory footprint of the queue would __________ .

  1. A

    drop to O(1)

  2. B

    practically remain the same

  3. C

    significantly decrease

  4. D

    significantly increase

Show answer

Correct answer

  • C

    significantly decrease

Video solution

The video solution to this question is being recorded and will play here. Until then, the answer key is above.

See the whole paperTake it as a mock test

Question 18 of 25 in the IIT Madras BS AI: Search Methods for Problem Solving (AI Search Methods) Quiz 1 paper sat on 19 Jul 2026, in the May 2026 term (Ai: Search Methods For Problem Solving 16 Jul 26). It carries 1 mark.

More questions from this paper

  1. Q1STATE SPACE SEARCH\ A gameboard is made of hexagonal tiles, allowing 6 directions of movement from each tile:\ north, s…
  2. Q2STATE SPACE SEARCH\ A gameboard is made of hexagonal tiles, allowing 6 directions of movement from each tile:\ north, s…
  3. Q3STATE SPACE SEARCH\ A gameboard is made of hexagonal tiles, allowing 6 directions of movement from each tile:\ north, s…
  4. Q4STATE SPACE SEARCH\ A gameboard is made of hexagonal tiles, allowing 6 directions of movement from each tile:\ north, s…
  5. Q5STATE SPACE SEARCH\ A gameboard is made of hexagonal tiles, allowing 6 directions of movement from each tile:\ north, s…
  6. Q6STATE SPACE SEARCH\ A gameboard is made of hexagonal tiles, allowing 6 directions of movement from each tile:\ north, s…
  7. Q7SEARCH\ Figure shows a gameboard with 12 positions (tiles A to L). MoveGen takes a position and returns a list of valid…
  8. Q8SEARCH\ Figure shows a gameboard with 12 positions (tiles A to L). MoveGen takes a position and returns a list of valid…
  9. Q9SEARCH\ Figure shows a gameboard with 12 positions (tiles A to L). MoveGen takes a position and returns a list of valid…
  10. Q10SEARCH\ Figure shows a gameboard with 12 positions (tiles A to L). MoveGen takes a position and returns a list of valid…
  11. Q11SEARCH\ Figure shows a gameboard with 12 positions (tiles A to L). MoveGen takes a position and returns a list of valid…
  12. Q12SEARCH\ Figure shows a gameboard with 12 positions (tiles A to L). MoveGen takes a position and returns a list of valid…
  13. Q13SEARCH\ Figure shows a gameboard with 12 positions (tiles A to L). MoveGen takes a position and returns a list of valid…
  14. Q14SEARCH\ Figure shows a gameboard with 12 positions (tiles A to L). MoveGen takes a position and returns a list of valid…
  15. Q15Select the formulas that are in Conjunctive Normal Form.
  16. Q16Perturbation method(s) used for TSP tour creation is/are .
  17. Q17If a genetic algorithm prematurely converges to a homogeneous suboptimal population, then which modification will preve…
  18. Q19In the Simulated Annealing schedule, if the temperature parameter T drops to absolute zero very early in the search pro…
  19. Q20TSP\ Figure shows a distance matrix for 5 cities, use it to construct TSP tours. Based on the above data, answer the gi…
  20. Q21TSP\ Figure shows a distance matrix for 5 cities, use it to construct TSP tours. Based on the above data, answer the gi…
  21. Q22TSP\ Figure shows a distance matrix for 5 cities, use it to construct TSP tours. Based on the above data, answer the gi…
  22. Q23A major drawback of Nearest Neighbour Heuristic for TSP is .
  23. Q24What is the core principle used in the Savings Heuristic for TSP?
  24. Q25The savings S(a,b) for two cities a and b relative to base/fulcrum city n is , where C(x,y) is the distance between cit…