Purchase Solution

Bit Strings

Not what you're looking for?

Ask Custom Question

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 a 1 and end with a 0? Explain

For your information question 9 part a could have been stated the following way. Computers use bit strings of length 8, called bytes, to represent the characters (letters both upper case and lower case, punctuation symbols, [, {, the integers 0 through 9 etc) on a key board. The Extended ASCII code is one such coding system. Some examples of this code are: â??aâ? is represented by 01100001, â??Aâ? is represented by 01000001 and â??{â?? is represented by 01111011 and the number 1 is represented by 00000001. How may such symbols can be described using a byte?

Purchase this Solution
Solution Summary

This posting contains the solution to the given problems.

Solution Preview

Answer:
a. There are 2^8 or 256 bit strings that have a length of 8. The combination starts from 00000000 to 11111111. A bit is represented by 2 numbers '1' and '0', so as the ...

Purchase this Solution
Free BrainMass Quizzes
Probability Quiz

Some questions on probability

Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

View More Free Quizzes
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?

  • bit strings

    315047 How many bit strings of length 6? (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 0? Explain.

  • 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.

  • 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) .

View More Related Solutions