Purchase Solution

Evaluate Bit Strings

Not what you're looking for?

Ask Custom Question

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?
How many bit strings of length 8 are there which contain exactly 3 ones?
How many bit strings of length 8 are palindromes?

Purchase this Solution
Solution Summary

In this solution, Bit Strings of length N are evaluated for different types. Ex Begin with 0 , End with 1.

Solution Preview

Let me try to explain what the problem is trying to ask you and give some definitions and concepts behind it.

First of all what is a bit string?
Bit string is an array which stores bits. As simple as that!
Ex: number 7 can be represented by 3 bit string 111 or a 4 bit string 0111.
Note: Bits are 0 and 1. And we are assuming binary system here.

If I give you 2 bit string, how many combinations of 0s and 1s you can come up with?
Well , let's see
Pattern for 2 bit string
00
01
10
11

So answer is I can come up with 4 different combinations
If I give you 3 bit string, if you do the same exercise as above, you ...

Purchase this Solution
Free BrainMass Quizzes
Basic Computer Terms

We use many basic terms like bit, pixel in our usual conversations about computers. Are we aware of what these mean? This little quiz is an attempt towards discovering that.

Excel Introductory Quiz

This quiz tests your knowledge of basics of MS-Excel.

Word 2010: Table of Contents

Ever wondered where a Table of Contents in a Word document comes from? Maybe you need a refresher on the topic? This quiz will remind you of the keywords and options used when working with a T.O.C. in Word 2010.

C# variables and classes

This quiz contains questions about C# classes and variables.

Word 2010: Tables

Have you never worked with Tables in Word 2010? Maybe it has been a while since you have used a Table in Word and you need to brush up on your skills. Several keywords and popular options are discussed as you go through this quiz.

View More Free Quizzes
Related BrainMass Solutions

  • Explain the Result of a Series of Bit String Operations

    In this solution I provided a detailed explanation on how to evaluate the given expression containing bit strings and the boolean operator XOR.

  • 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

    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.

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

View More Related Solutions