Answer:
0011100000
1010010001
0111001110
Step-by-step explanation:
As the question is not complete, Here is the complete question.
Suppose that the universal set is U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}. Express each of these sets with bit strings where the ith bit in the string is 1 if i is in the set and 0 otherwise.
a) {3, 4, 5}
b) {1, 3, 6, 10}
c) {2, 3, 4, 7, 8, 9}.
So, we need to express a) b) and c) into bit strings.
Firstly, number of elements in the universal set represent the number of bits in the bit string.
Secondly, 1 = yes element is present in both universal set as well as in sub set.
0 = No, element is not present in sub set but present in universal set.
Hence, we have:
a) Sub set {3,4,5} = 0011100000 (As there are 3 1's which means only 3,4,5 are present in both universal set and subset.
Similarly,
b) Sub set {1, 3, 6, 10} = 1010010001
c) Sub set {2, 3, 4, 7, 8, 9} = 0111001110
= 6.7082