Gate CS-2008 Question Paper With Solutions

Q. 59 Solve the problems and choose the correct answers.
Let xn denote the number of binary strings of length n that contain no consecutive
so.

Which of the following recurrences does xn satisfy?

Gate CS-2008 Question Paper With Solutions

Answer: (D)

Explanation:

Gate CS-2008 Question Paper With Solutions

Learn More:   Gate CS-2015-1 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here