retagged by
2,603 views

1 Answer

0 votes
0 votes

We know that a bit contain 2 values ( 0 and 1)

Bit Strings of length 7 either begin with two 0s or end with three 1s

      = Strings of length 7 begin with two 0s + Strings of length 7  end with three 1s -      Strings of length 7 either begin with two 0s or end with three 1s


Now Strings of length 7  begin with two 0s:

First Digit : 1 way ( it has to be 0)

Second Digit : 1 way ( it has to be 0)

Third Digit : 2 ways

Fourth Digit : 2 ways

Fifth Digit : 2 ways

Sixth Digit : 2 ways

Seventh Digit : 2 ways

No of ways = 1 x 1 x 2 x 2 x 2 x 2 x 2 = 32 ways

Now Strings of length 7 end with three 1s:

First Digit : 2 ways

Second Digit : 2 ways 

Third Digit : 2 ways 

Fourth Digit : 2 ways

Fifth Digit : 1 way (it has to be 1)

Sixth Digit : 1 way (it has to be 1)

Seventh Digit : 1 way (it has to be 1)

No of ways = 2 x 2 x 2 x 2 x 1 x 1 x 1 = 16 ways

Now Strings of length 7 either begin with two 0s or end with three 1s:

First Digit : 1 way (it has to be 0)

Second Digit : 1 way (it has to be 0)

Third Digit : 2 ways 

Fourth Digit : 2 ways

Fifth Digit : 1 way (it has to be 1)

Sixth Digit : 1 way (it has to be 1)

Seventh Digit : 1 way (it has to be 1)

No of ways = 1 x 1 x 2 x 2 x 1 x 1 x 1 = 4 ways


       = Strings of length 7 begin with two 0s + Strings of length 7  end with three 1s -       Strings of length 7 either begin with two 0s or end with  three 1s

      = 32 + 16 - 4

      = 44 bit strings

 

Thus 44 bit strings of length 7 either begin with two 0s or end with three 1s.

Related questions

0 votes
0 votes
0 answers
1
admin asked Apr 29, 2020
354 views
Use the product rule to show that there are $2^{2^{n}}$ different truth tables for propositions in $n$ variables.
0 votes
0 votes
0 answers
4
admin asked Apr 29, 2020
421 views
Use a tree diagram to determine the number of subsets of $\{3, 7, 9, 11, 24\}$ with the property that the sum of the elements in the subset is less than $28.$