Discrete Mathematics and Its Applications, Seventh Edition

Published by McGraw-Hill Education
ISBN 10: 0073383090
ISBN 13: 978-0-07338-309-5

Chapter 6 - Section 6.6 - Generating Permutations and Combinations - Review Questions - Page 440: 5

Answer

240 bit strings

Work Step by Step

The number of strings beginning with 101 is $2^{7}$ since every bit after 101 can be either 0 or 1. By similar logic, we get the number of strings that end with 010 i.e $2^{7}$. The number of strings that start with 101 and end with 010 is $2^{4}$ as there are only 4 bits that have to be filled. So the solution is $2^{7}$.+$2^{7}$.-$2^{4}$ = 240.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.