How many 8-bit strings (that is, bit strings of length 8) are there which: Have weight 5 and either start with 101 or end with 11 (or both)? Explain.
Added by Crystal W.
Step 1
The weight of a string is the number of 1s in it. So, we need to find the number of ways to choose 5 positions for 1s out of 8. This is a combination problem, and the answer is C(8,5) = 56. Show more…
Show all steps
Close
Your feedback will help us improve your experience
Nick Johnson and 98 other Algebra educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
How many eight-bit strings begin $1100 ?$
Counting Methods and the Pigeonhole Principle
Basic Principles
How many 8-bit strings contain six or more 1s
Shubham S.
How many bit strings of length 10 either begin with three 0s or end with two 0 $\mathrm{s} ?$
Counting
The Basics of Counting
Recommended Textbooks
Elementary and Intermediate Algebra
Algebra and Trigonometry
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD