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:
Explanation: There are n zeros placed :
Attention reader! Don’t stop learning now. Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.
Learn all GATE CS concepts with Free Live Classes on our youtube channel.
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