Practice Example Of Bit Strings Without Consecutive 0's (13.2)

Practise this section

9 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
3 questions · about 2 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What is C(1)?
Show hintHide hint
Consider the valid strings of length 1.
Question 2.
List the valid bit strings of length 2.
Show hintHide hint
Remember that two consecutive zeros are not allowed.
3Question 3.
What is C(2)?
- 1
- 2
- 3
Show hintHide hint
Count the valid strings of two bits.
4Question 4.
C(n) is defined as?
- True
- False
Show hintHide hint
Remember what our function counts.
Question 5.
Using the recurrence relation, calculate C(6) and validate your answer.
Show hintHide hint
Don’t forget to use the previous two values you computed.
Question 6.
Create a program that generates all possible n-bit strings and filters out those containing consecutive 0's. Verify its output for n = 5.
Show hintHide hint
Try using recursive functions for bit generation.

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