edited by
4,641 views
2 votes
2 votes

If T (0) = T (1 ) = 1, each of the following recurrences for n ≥ 2 defines a function T on the non negative integers. Which of the following CANNOT be bounded by a polynomial function?

  1. T ( n)  = 3T(n/2)+  n2
  2. T(n)=  T(7n/8)+ 8n
  3. T (n)= 2T(n-2)+1
  4. T (n)= T(n-1)+ n2


How to solve this?

Please explain

edited by

2 Answers

1 votes
1 votes

When we are solving option (c) $T(n)=2T(n-1)+1$ the solution will be $T(n)=2^{n+1}-1$, which is exponential order. (This is the recurrence corresponding to Tower of Hanoi).

and by applying masters theorem to others we will get Option (A) is $n^2$, option(B) is $n$ and option(D) is $n^3$

Answer is C

edited by

Related questions

1 votes
1 votes
1 answer
1
kalpish asked Apr 8, 2015
1,076 views
At the end of it's 5th Successful season,The siruseri Permier league is planning to give an award to most improved bowler over 5 years . For this an important Index will ...
2 votes
2 votes
1 answer
2
2 votes
2 votes
0 answers
3
Payal Rastogi asked Nov 15, 2015
353 views
0 votes
0 votes
3 answers
4