Let xn denote the number of binary strings of length n that contain no two…
GATE · 2008 · CSModified — slightly modified from the official paper; see the solution
Let xn denote the number of binary strings of length n that contain no two consecutive 0s. This sequence satisfies the recurrence xn = xn-1 + xn-2.
The value of x5 is:
- A.
5
- B.
7
- C.
8
- D.
13
Attempted by 1 students.
Sign up free to check your answer
Sign up freeLoading lesson…