Purchase Solution

palindromes

Not what you're looking for?

Ask Custom Question

How many bit strings of length n are palindromes? Hint: Consider two cases n is even and n is odd. Note a palindrome is a "string" of letters or numbers which read the same frontwards and backwards. Examples: MOM, 1101011, 10111101 are palindromes.

Purchase this Solution
Solution Summary

String bits and palindromes are assessed in this solution.

Solution Preview

Hello and thank you for posting your question to BrainMass.

Let's see first how many different strings we can make with k bits.

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.
In a k length string, each bit has two possible values, hence the total number of strings is 2x2x.....2 = 2^k

Now we can start with out palindrome strings of length n.
Say we set the k<n bit. Then, by the definition of the palindrome this immediately sets the ...

Purchase this Solution
Free BrainMass Quizzes
Multiplying Complex Numbers

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

Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.

Graphs and Functions

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

Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

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

  • Palindromes

    15376 Palindromes Range Values What are the palindromes between 100 & 200? Find the range, mode, and median. Solution.

  • C++ code to test for matching brackets and palindromes

    Also, it tests for palindromes via two different implementations.

  • A Recursive Javascript Function to Detect Palindromes

    This solution shows how to create a recursive Javascript function to identify palindromes. See attachment.

  • Palindromes - Blanks Ignored - Java

    128029 Palindromes - Blanks Ignored - Java A palindrome is a string that will spell the same way forward and backward. Some examples of palindromes are "radar", "able was I ere I saw elba" and (if blanks are ignored) "a man a plan a canal panama".

  • A recursive C function to detect palindromes

    181428 A recursive C function to detect palindromes A palindrome consists of a word or deblanked, unpunctuated phrase that is spelled exactly the same when the letters are reversed.

  • Evaluate Bit Strings

    How many bit strings of length 8 are palindromes Palindrome is a string, which reads the same forward or backward.

  • Palindrome Using BufferedReader

    The input file that you will be reading palindromes from is called "pals.txt". Look for methods like replace (), to lowerCase, to UpperCase,..etc. Write the output ( the string and if is a palindrome) to a file called "palsout.txt".

  • Turing Machine for even palindromes

    106757 Turing Machine for even palindromes Construct a turing machine that accepts the language {ww^R : w <- {a,b}+}, where w^R denotes w superscripted R - reverse of w.

  • Restriction endonucleases

    this results in the possibility for palindromes - sequences which read the same forwards on one strand as they do backwards on the other. see this site for a diagram: http://users.rcn.com/jkimball.ma.ultranet/BiologyPages/P/Palindromes.html .

View More Related Solutions