UTpaper

Free mock tests & test series

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

Which of the following is the time complexity of dynamic programming algorithm to compute the Binomial coefficient nCk?

  1. AΘ(nk)
  2. BΘ(kⁿ)
  3. CΘ(nᵏ)
  4. DΘ(n + k)
Show answerHide answer

Correct answer: (A) Θ(nk)

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

This is question 106 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.