1.
Consider the eight bit strings of length 3. Letβs find the number of strings that start with 1 or have weight 2 (i.e., contain exactly two 1s).
(a)
List all the 3-bit strings that start with 1.
(b)
List all the 3-bit strings that have weight 2.
(c)
Now list all the 3-bit strings that start with 1 or have weight 2. But be lazy: Donβt list them from scratch. Use your lists from the two tasks above.
(d)
How many strings are there in the lists?
-
Strings that start with 1:
-
Strings of weight 2:
-
Strings that start with 1 or have weight 2:
-
Strings that both start with a 1 and have weight 2:
