Gate CS-2016-1 Question Paper With Solutions

Q. 12 Let an be the number of n-bit strings that do NOT contain two consecutive 1s. Which one of the following is the recurrence relation for an

Gate CS-2016-1 Question Paper With Solutions

Answer: (B)

Explanation:

Gate CS-2016-1 Question Paper With Solutions

Learn More:   Gate ME-2005 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here