recategorized by
594 views
1 votes
1 votes
Let $A(n)$ denotes the number of $n$ bit binary strings which have no pair of consecutive $1’s.$ what will be recurrence relation for it and what will be it’s Time Complexity??
recategorized by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
1
aka 53 asked Nov 21, 2017
1,578 views
T(n) = 4T(n/2) + C ......where C ConstantT(n) = 16T(n/4) + 5CCant figure out how to generalize and compare with base condition T(n) = 1 from above step.
0 votes
0 votes
1 answer
2
eyeamgj asked Jun 24, 2018
397 views
consider the following c program A(n){if(n<=1)return(n2 +n+1)elsereturn(5A(n/2)+3A(n/2)+MA(n))}where MA(n) has complexity O(n2).1.what is the recurrence relation for valu...
1 votes
1 votes
2 answers
3
srestha asked May 10, 2019
844 views
What is the solution of recurrence relation$T\left ( n \right )=T\left ( n-1 \right )+n$
1 votes
1 votes
1 answer
4
VikramRB asked Jan 20, 2019
1,005 views
What is the time complexity of the following recurrence relation and step to derive the same$T(n) = T(\sqrt{n}) + log(logn)$