Question

(2 points) How many 10-bit strings (that is, bit strings of length 10) are there which: a. Start with the sub-string 011? b. Have weight 4 (i.e., contain exactly 4 1's) and start with the sub-string 011? c. Either start with 011 or end with 01 (or both)? d. Have weight 4 and either start with 011 or end with 01 (or both)?

          (2 points)
How many 10-bit strings (that is, bit strings of length 10) are there which:
a. Start with the sub-string 011?
b. Have weight 4 (i.e., contain exactly 4 1's) and start with the sub-string 011?
c. Either start with 011 or end with 01 (or both)?
d. Have weight 4 and either start with 011 or end with 01 (or both)?

(2 points)
How many 10-bit strings (that is, bit strings of length 10) are there which:
a. Start with the sub-string 011?
b. Have weight 4 (i.e., contain exactly 4 1's) and start with the sub-string 011?
c. Either start with 011 or end with 01 (or both)?
d. Have weight 4 and either start with 011 or end with 01 (or both)?

Added by Eric W.

Calculus: Early Transcendentals

James Stewart 8th Edition

Instant Answer

Solved by Expert Suman K

Step 1

Start with the sub-string 011: There are 7 remaining bits, and each can be either 0 or 1. So there are $2^7 = 128$ such strings. Show more…

Show all steps

Thanks for your feedback!

How many 10-bit strings (that is, bit strings of length 10) are there which: Start with the sub-string 011? Have weight 4 (i.e., contain exactly 4 1's) and start with the sub-string 011? Either start with 011 or end with 01 (or both)? Have weight 4 and either start with 011 or end with 01 (or both)?