The GATE Grind

GATE 2008 CS – Question 79

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

Let xₙ count n-bit binary strings containing no consecutive0s, using the recurrence in Q78. What is x₅?

  1. 5
  2. 7
  3. 8
  4. 16

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: MTA

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 →