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?
Solve by using power series: 2 y'−y = sinh( x). Find the
recurrence relation and compute the first 6 coefficients (a0-a5).
Use the methods of chapter 3 to solve the differential equation and
show your chapter 8 solution is equivalent to your chapter 3
solution.
Solve the following recurrence relations. a. x(n) = x(n − 1) + 3
for n > 1, x(1) = 0 b. x(n) = 5x(n − 1) for n > 1, x(1) = 6
c. x(n) = x(n/5) + 1 for n > 1, x(1) = 1 (solve for n = 5k )