a) Find the recurrence relation for the number of ways to
arrange flags on an n foot flagpole with 1 foot high red flags, 2
feet high white flags and 1 foot high blue flags.
b) solve the recurrence relation of part a
find a
recurrence relation for the number of bit strings of length n that
contain the string 10. What are the initial conditions? How many
bit strings of length eight contain the string 10
find a
recurrence relation for the number of bit strings of length n that
contain two consecutive 1s. What are the initial conditions? How
many bit strings of length eight contain two consecutive
1s
1Set up and solve a recurrence relation for the number of times
the algorithm’s basic operation is executed.
2 How does this algorithm compare with the straightforward
nonrecursive algorithm for computing this function?
consider the linear non-homogeneous recurrence relation of order
three x(n)+x(n-1)-4x(n-2)-4x(n-3)=16
find the eigenvalues of the recurrence relation, the closed form
solution, and based on the dominant Eigen value determine if x(n)
has longterm exponential growth