The GATE Grind

GATE 2008 CS – Question 78

Engineering Mathematics · Discrete Mathematics: Combinatorics (Counting, Recurrence Relations, Generating Functions) · 2 marks · Multiple choice

Let xₙ count n-bit binary strings with no consecutive0s. Which recurrence holds?

  1. $x_n=2x_{n-1}$
  2. $x_n=x_{\lfloor n/2\rfloor}+1$
  3. $x_n=x_{\lfloor n/2\rfloor}+n$
  4. $x_n=x_{n-1}+x_{n-2}$

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (D) $x_n=x_{n-1}+x_{n-2}$

Explanation

We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort

More Discrete Mathematics: Combinatorics (Counting, Recurrence Relations, Generating Functions) questions

All Discrete Mathematics: Combinatorics (Counting, Recurrence Relations, Generating Functions) questions →