Tuesday, July 6, 2010

Practice problems for homework 5

Link to a set of contingency table problems.

Sets to bitstrings and vice versa.

Let the universal set U = {red, orange, yellow, green, blue, violet} in that order.

Change sets into bitstrings of length six.

{red, yellow, blue} -> ___________

{red, orange, yellow} -> ____________

{orange, violet} -> ____________

Change bitstrings into sets.

10 0111 -> _______________

01 0101 -> _______________

00 000 -> _______________

Answers to the set and bitstring questions in the comments.

1 comment:

Prof. Hubbard said...

Let the universal set U = {red, orange, yellow, green, blue, violet} in that order.

Change sets into bitstrings of length six.

{red, yellow, blue} -> 10 1010

{red, orange, yellow} -> 11 1000

{orange, violet} -> 01 0001

Change bitstrings into sets.

10 0111 -> {red, green, blue, violet}

01 0101 -> {orange, green, violet}

00 000 -> Ø
This is the symbol for the empty set.