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 }
Accepted Solution
A:
Answer:a.0011100000b.1010010001c.0111001110Step-by-step explanation:We are given that a universal set U={1,2,3,4,5,...10}We have to express each given set with bit strings , where the ith bit in the string is 1 if i is in the set and 0 otherwisea.{3,4,5}For 1=0 because 1 is not in the given setFor 3=1, For 4=2 , For 5=1 because 3,4 and 5 are in the setFor 2=0For 6=0For 7=0For 8=0For 9=0For 10=0Therefore, bit string=0011100000b.{1,3,6,10}For 1,3,6 and 10 write 1 because these elements are present in the set and for 2,4,5,7,8,9 write 0 because these elements are not present in the setBit string =1010010001c.{2,3,4,7,8,9}Similarly Those elements which are present in the set then for those elements write 1 otherwise 0.Bit string =0111001110