Question

How many bit strings of length n are palindromes

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: 1101011, 10111101 are palindromes.
0 0
Add a comment Improve this question Transcribed image text
Answer #1
10x10x10x10x10x10 =
answered by: Kaniria
Add a comment
Answer #2
help
answered by: Sabeva
Add a comment
Know the answer?
Add Answer to:
How many bit strings of length n are palindromes
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT