Practice Recurrence Equation For Bad Strings (16.2.3)

Practise this section

8 questions

Flashcard drill
2 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
2 questions · about 1 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What is the value of B(1)?
Show hintHide hint
Think of the possible single-bit strings.
Question 2.
List three categories of bad strings.
Show hintHide hint
Consider different starting conditions for strings.
3Question 3.
What is the recurrence relation for B(n)?
- B(n) = B(n-1) + B(n-2) + B(n-3)
- B(n) = B(n-1)
- B(n) = B(n-2) + B(n-3)
Show hintHide hint
Recall our categories of bad strings.
4Question 4.
Is B(3) equal to 4?
- True
- False
Show hintHide hint
List all valid strings of length 3.
Question 5.
Calculate B(5) based on previous values.
Show hintHide hint
Keep applying the derived relation repeatedly.
Question 6.
Provide a comprehensive proof of B(n) as a generating function.
Show hintHide hint
Involve elements from your string category counts.

4 more questions in this section. Enroll free to practise them all.