GATE | GATE CS 1999 | Question 3

The number of binary strings of n zeros and k ones such that no two ones are adjacent is:

(A) a
(B) b
(C) c
(D) d

Answer: (D)

Explanation: There are n zeros placed :


So, (n+1) gaps. Now we can place k 1’s in those place n+1Ck ways.

Option (D) is correct.

Quiz of this Question

My Personal Notes arrow_drop_up
Article Tags :

Be the First to upvote.

Please write to us at to report any issue with the above content.