UTpaper

Free mock tests & test series

Question 57Asked in UGC NET Computer Science, November 2017 (Paper II & III, Selected Questions)

If b is the branding factor and m is the maximum depth of the search tree, what is the space complexity of greedy search?

  1. AO(b + m)
  2. BO(bm)
  3. CO(bᵐ)
  4. DO(mᵇ)
Show answerHide answer

Correct answer: (C) O(bᵐ)

Explanation

In the worst case greedy (best-first) search keeps all generated nodes in memory. With branching factor b and maximum depth m, the space complexity is O(bᵐ).

From UGC NET Computer Science PYQ, November 2017 (Paper II & III, Selected Questions)

This is question 57 of UGC NET Computer Science PYQ, November 2017 (Paper II & III, Selected Questions). See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.