Counting bit strings. how many 10-bit strings are there subject to each of the following restrictions? (a) no restrictions. the string starts with 001. the string starts with 001 or 10. the first two bits are the same as the last two bits. the string has exactly six o's. the string has exactly six o's and the first bit is 1. there is exactly one 1 in the first half and exactly three 1's in the second half.

a) With no restrictions, there are 1024 possibilies

b) There are 128 possibilities for which the tring starts with 001

c) There are 256+128 = 384 strings starting with 001 or 10.

d) There are 128  possiblities of strings where the first two bits are the same as the last two bits

e)There are 210 possibilities in which the string has exactly six 0's.

f) 84 possibilities in which the string has exactly six O's and the first bit is 1

g) 50 strings in which there is exactly one 1 in the first half and exactly three 1's in the second half

Step-by-step explanation:

Our string is like this:

B1-B2-B3-B4-B5-B6-B7-B8-B9-B10

B1 is the bit in position 1, B2 position 2,...

A bit can have two values: 0 or 1

So

No restrictions:

It can be:

2-2-2-2-2-2-2-2-2-2

There are possibilities

The string starts with 001

There is only one possibility for each of the first three bits(0,0 and 1) So:

1-1-1-2-2-2-2-2-2-2

There are possibilities

The string starts with 001 or 10

There are 128 possibilities for which the tring starts with 001, as we found above.

With 10, there is only one possibility for each of the first two bits, so:

1-1-2-2-2-2-2-2-2-2

There are possibilities

There are 256+128 = 384 strings starting with 001 or 10.

The first two bits are the same as the last two bits

The is only one possibility for the first two and for the last two bits.

1-1-2-2-2-2-2-2-1-1

The first two and last two bits can be 0-0-...-0-0, 0-1-...-0-1, 1-0-...-1-0 or 1-1-...-1-1, so there are possiblities of strings where the first two bits are the same as the last two bits.

The string has exactly six o's:

There is only one bit possible for each position of the string. However, these bits can be permutated, which means we have a permutation of 10 bits repeatad 6(zeros) and 4(ones) times, so there are

210 possibilities in which the string has exactly six 0's.

The string has exactly six O's and the first bit is 1:

The first bit is one. For each of the remaining nine bits, there is one possiblity for each.  However, these bits can be permutated, which means we have a permutation of 9 bits repeatad 6(zeros) and 3(ones) times, so there are

84 possibilities in which the string has exactly six O's and the first bit is 1

There is exactly one 1 in the first half and exactly three 1's in the second half

We compute the number of strings possible in each half, and multiply them:

For the first half, each of the five bits has only one possibile value, but they can be permutated. We have a permutation of 5 bits, with repetitions of 4(zeros) and 1(ones) bits.

So, for the first half there are:

5 possibilies where there is exactly one 1 in the first half.

For the second half, each of the five bits has only one possibile value, but they can be permutated.  We have a permutation of 5 bits, with repetitions of 3(ones) and 2(zeros) bits.

10 possibilies where there is exactly three 1's in the second half.

It means that for each first half of the string possibility, there are 10 possible second half possibilities. So there are 5+10 = 50 strings in which there is exactly one 1 in the first half and exactly three 1's in the second half.

sum= when you add is how much the whole amount is

distance= when you use angles and it means how far it goes

step-by-step explanation:

2x^2+5x+17

your welcome. : )