Homework SourseDISCRETE MATH Consider all bit strings of length 12 a bit st
DISCRETE MATH
Consider all bit strings of length 12 (a bit string is a \"word\" in which all characters are either a 1 or a 0).
How many begin with 110?
29
211
212 - 29
212
| 29 | ||
| 211 | ||
| 212 - 29 | ||
| 212 |
Solution
Consider all bit strings of length 12
Q :- How many begin with 110 ?
Ans:- 29.
![DISCRETE MATH Consider all bit strings of length 12 (a bit string is a \](/WebImages/16/discrete-math-consider-all-bit-strings-of-length-12-a-bit-st-1026930-1761531795-0.webp "DISCRETE MATH Consider all bit strings of length 12 (a bit string is a \")
