Q49

MCQ2 marks, −0.67

Let a $_{n}$ represent the number of bit strings of length n containing two consecutive $1$ s. What is the recurrence relation for $a_{n}$ ?

(A)

$a_{n - 2} + a_{n - 1} + 2^{n - 2}$

(B)

$a_{n - 2} + 2a_{n - 1} + 2^{n - 2}$

(C)

$2a_{n - 2} + a_{n - 1} + 2^{n - 2}$

(D)

$2a_{n - 2} + 2a_{n - 1} + 2^{n - 2}$

Loading…