Skip to content
Related Articles

Related Articles

GATE | GATE CS 1999 | Question 3
  • Difficulty Level : Medium
  • Last Updated : 10 Oct, 2017

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

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


Answer: (D)

Explanation: There are n zeros placed :

_0_0_0_….._0_

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

sudo-gate-course

My Personal Notes arrow_drop_up
Recommended Articles
Page :