Test Index

GATE CS and IT 2015 Paper

© examsnet.com

Question : 45

Total: 65

Let an represent the number of bit strings of length n containing two consecutive 1s. What is the recurrence relation for an ?

an−2+an−1+2n−2
an−2+2an−1+2n−2
2an−2+an−1+2n−2
2an−2+2an−1+2n−2

Go to Question:

Prev Question

Next Question