Practice Categories Of Bad Strings (16.2.2)

Practise this section

8 questions

Flashcard drill
3 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 a bad string?
Show hintHide hint
Think about what sequences you would want to exclude.
Question 2.
How many valid strings of length 2 exist?
Show hintHide hint
List all the possible strings of length 2.
3Question 3.
What is the characteristic of a bad string?
- Contains '000'
- Does not contain '000'
- Has mixed characters
Show hintHide hint
Remember the definition from class.
4Question 4.
True or False: All strings of length 3 contain a valid configuration based on our recurrence relation.
- True
- False
Show hintHide hint
Think about examples of string patterns.
Question 5.
Calculate and prove $S(6)$ using previous calculated values.
Show hintHide hint
Refer back to your established pattern and apply modified counts.
Question 6.
Find a pattern by plotting values of $S(n)$ against $n$ , and deduce future terms.
Show hintHide hint
What do the numbers suggest?

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