0 votes 0 votes Consider a bit-string of length 10 containing only 0 and 1. The number of string contain exactly 3 0’s or exactly 31’s are ________ Mathematical Logic combinatory + – Jaspreet Kaur Bains asked Dec 21, 2017 Jaspreet Kaur Bains 289 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes A = Number of string contain exactly 3 0’s B= Number of string contain exactly 3 1’s |A U B | = |A| + |B| - |A intersecton B| A= 10!/3!7! B=10!/3!7! |A intersecton B| = 0 |A U B | = 120+120-0 =240 Akash Mittal answered Dec 22, 2017 Akash Mittal comment Share Follow See all 0 reply Please log in or register to add a comment.
