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
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
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 and solve a recurrence relation for the number of ways to stack n poker
chips using red, white and blue chips such that no two red chips are together.
Use your solution to compute the number of ways to stack 15 poker chips.
Find a system of recurrence relations for the number of n-digit quaternary sequences that contain an even number of 2’s and an odd number of 3’s. Define the initial conditions for the system. (A quaternary digit is either a 0, 1, 2 or 3)
Give a recurrence relation to find the length of the longest
monotonically increasing subsequent of a array. Give the recursive
algorithm based on the recurrence relation and explain the time
complexity of this algorithm.
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?