bit strings

Related BrainMass Solutions

• Evaluate Bit Strings

  513519 Evaluate Bit Strings Please help answer the following questions. How many bit strings of length 6? How many bit strings of length 6 is there that begin with 0 or end with a 1?

• Set Partitions and Bit Strings

  a) The set of bit strings that end with 00; the set of bit strings that end with 01; the set of bit strings that end with 10; and the set of bit strings that end with 11.

• Bit Strings

  127204 Bit Strings (a) How many bit strings of length 6 are there? Explain fully. (b) How many bit strings of length 6 are there which begin with a 0 and end with a 0? Explain fully.

• How do you find how many bit strings of length 6 are there?

  (c) How many bit strings of length 6 start with a 1 bit or end with a 0 bit? Explain. (a) There are 2^6=64 different bit strings of length 6.

• Computations and permutations

  So there are C(10,3)=120 bit strings of length 10 that have exactly three 0s. How many bit strings of length 10 have more 0s than 1s?

• palindromes

  If we have one bit, then we have two possible strings (namely "0" and "1") If we have k=2 bits, then we have to possibilities for the first bit and two possibilities for the second bit, so together there are 2x2 = 4 possibles strings.

• Rule of Products

  *possible values that 8th bit can take = 2*2*2*2*2*2 = 2^6 = 64 This solution contains calculations of number of bit strings of length eight.

• Bit Strings

  An example, of a bit string of length five is 11010. Use the Rule of Products to determine the following: (a) How many bit strings are there of length eight?

• Recurrence relations - initial conditions

  Then the number of bit strings of length n - 3 which do not contain three consecutive 0s (and therefore the number of bit strings of length n + 1 containing three consecutive 0s exactly at the end) is 2^(n-3) - a_(n-3) .