The number of binary strings with n zeros and k ones such that no two ones are…
GATE · 1999 · CS · Question 1 subparts
The number of binary strings with n zeros and k ones such that no two ones are adjacent is:
- A.
C(n - 1, k)
- B.
C(n, k)
- C.
C(n, k + 1)
- D.
None of the above
Attempted by 163 students.
Sign up free to check your answer
Sign up freeLoading lesson…