← Quiz: Recurrence Relations: all 10 questions
Quiz: Recurrence Relations · Question 2 of 10
How many binary strings of length 5 have no two consecutive 1s (from the demo)?
How many binary strings of length 5 have no two consecutive 1s (from the demo)?
- A.8
- B.11
- C.13
- D.21
Answer & explanation
Correct answer: 13
The sequence is 2, 3, 5, 8, 13, … so length 5 gives 13.
Can you get the rest right without peeking?
Take the timed Quiz: Recurrence Relations quiz free. Pass it to earn XP and count towards your certificate.
Start the quiz →