UTpaper

Free mock tests & test series

Question 152Asked in CIL MT Systems, 26 Mar 2017 (12:30 PM)

Which of the following is the every-case time complexity of dynamic programming algorithm for "traversing salesperson" problem to traverse 'n' cities?

  1. AΘ(log n · 2ⁿ)
  2. BΘ(n · 2ⁿ)
  3. CΘ(2ⁿ)
  4. DΘ(n² · 2ⁿ)
Show answerHide answer

Correct answer: (B) Θ(n · 2ⁿ)

From CIL MT Systems PYQ, 26 Mar 2017 (12:30 PM)

This is question 152 of CIL MT Systems PYQ, 26 Mar 2017 (12:30 PM). 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.