Sets can be represented using bit strings. For example, the universal set ? ={?, ?,?,?, ?,?,?, ?,?} has bit string representation: 11111111111. When elements are missing in a subset of U, we can replace the corresponding bits in the bit string with zeros. With such representation of a set the order of elements matters. For example:

? = {1, 2, 3, 4} can be represented using the bit string: 011110000

? = {5, 6, 9} can be represented using the bit string: 000001100

1. Considering the universal set as above, represent the following sets using bit strings, given ^{[ /5]}

? = {3?-1|? ? ?}

? = {?| ? ? ?^!, ? ?? ? ???????? 30}

a.?

b.? ? ?

c.? ? ?

d.? ? ?

Find the domain and range of the function that assigns a 3-bit signed binary number its decimal value. What is the number of elements in both sets? Find the domain and range for the following functions:

[ /2] [ /3]

1. ?
   

X -2x +6+2