Mathematics Homework Solutions
Problem
#115354

Rule of Products

A bit string is a string of  bits (0's and 1's).  
The length of a bit string is the number of bits in the string.  
An example, of a bit string of length four is 0010.  
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?  Explain.
(b) How many bit strings are there of length eight which begin with two 1's?   Explain.


Solution Summary

Solution contains calculations of number of bit strings of length eight'.

Solution
What is this?
By OTA - Overall OTA Rating
Purchase Cost Now
$2.19 CAD (was ~$3.99)
Included in Download
  • Plain text response
$2.19 Instant Download
Add to Cart
Why you can trust BrainMass.com
  • Your Information is Secure
  • Best Online Academic Help Service
  • Students find real academic Success
Related Solutions
  • Bit String Lengths - (a) How many bit strings of length 6 are there? Explain. (b) How many bit strings of length 6 are there which begin with a 0 and end with a 1? Explain. (c) How many bit strings of length 6 start wit ...
  • Discrete math word problem - A set S of bit strings is defined in the following way: 1. the empty string is an element of S 2. 0x1 is an element of S if x is an element of S. a. List five specific elements of S. b. List ...
  • Induction Proof : Strings of Digits - If n >= 1, the number of strings using the digits 0,1, and 2 with no two consecutive places holding the same digit, is 3x2^n-1. For example, there are 12 such strings of length three: 010, 012, 020, ...
  • Grammar Induction - Consider the grammar 1) -> |epsilon 2) -> 0|1|2|3|4|5|6|7|8|9 Use induction to show that the number of strings in L() of length n is equal to 10^ ...
  • Working with permutations and combinations - Permutations and coefficients (a) How many bit strings of length 7 are there? Explain. (b) How many bit strings of length 7 are there which begin with a 0 and end with a 1? Explain. ...
Browse