Answer to Question #332254 in Discrete Mathematics for BIG MARIO

Question

 Using the same universal set, find the set specified by each of these bit strings. 

(i) 11 1100 1111 (ii) 01 0111 1000 (iii) 10 0000 0001 

Answer 1

I don't know your universal set. But so I work with set U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}. Size of set equals to number of bits.

Note: If i-th bit is 1 then i-th element of set is part of specified set with that bitmask. And if i-th bit is 0 then i-th element of set is NOT part of specified set with that bitmask.

(i) {1, 2, 3, 4, 7, 8, 9, 10}

(ii) {2, 4, 5, 6, 7}

(iii) {1, 10}