in Algorithms recategorized by
591 views
1 vote
1 vote
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??
in Algorithms recategorized by
by
591 views

4 Comments

@srestha mam, $a_1=2$ because 0 and 1 are possible strings of size 1 where no consecutive 1 occurs 

1
1
but then it just a count of elements

Here we want how recurrence grows

right??
0
0
recurrence is defined  for 'no. of n bit strings where no two consecutive 1s occur'

Please check the given pic and understand the meaning of $a_n, a_{n-1},a_{n-2}$
0
0

Please log in or register to answer this question.

Related questions