Find the bit string for the following sets.

  • Thread starter Hodgey8806
  • Start date
  • #1
145
3

Homework Statement


The a universal set: u = {1,2,3,4,5,6,7,8,9,10}

1) Find the bit string for b = {4,3,3,5,2,3,3,}

2) Find the bit string for the union of two sets.


Homework Equations



1)Would I first begin this problem by realizing that set b is the same as {2,3,4,5}?

The Attempt at a Solution



1)If so, then the bit string would 0111100000.

2)Would I say that the union of two sets would give a truth table such as 1110. Is this correct?

Is this correct? thanks!
 

Answers and Replies

  • #2
35,118
6,860

Homework Statement


The a universal set: u = {1,2,3,4,5,6,7,8,9,10}

1) Find the bit string for b = {4,3,3,5,2,3,3,}

2) Find the bit string for the union of two sets.


Homework Equations



1)Would I first begin this problem by realizing that set b is the same as {2,3,4,5}?
It would be helpful for you to tell us what b actually is. There is not usually any indication in a set of whether any of the elements are duplicates, so it's not clear to me what {4, 3, 3, 5, 2, 3, 3} is supposed to represent.

Otherwise, if what you are supposed to do is show a string of bits that indicates the elements in b, then {0, 1, 1, 1, 1, 0, 0, 0, 0, 0} seems reasonable to me.


The Attempt at a Solution



1)If so, then the bit string would 0111100000.

2)Would I say that the union of two sets would give a truth table such as 1110. Is this correct?

Is this correct? thanks!

The union of two sets is all those elements that are in the first set, or in the second set, or in their intersection.
 
  • #3
145
3
The problem gives b to be a subset of the universal set. And b is the set of those elements "b = {4,3,3,5,2,3,3}". The question just asked me to find a bit string using the universal set given above. So I'm assuming that the duplicates can be done away with so that b is really just the set b = (2,3,4,5}. (Forgive me for not using an upper case b. I didn't think about it originally so I will use lower case for continuity.)

Also, the problem in the paper did not specify any sets for question number 2. It doesn't give any universal set or any other two sets. It was just a general question I'm assuming that the teacher meant that represents ALL sets. If that is not actually possible, then I can understand that I must be given a minimum of two sets to find the bit string for the union or intersection.

However, the questions are both worded exactly as on my paper and number 2 doesn't discuss any example sets. It just has that sentence and nothing else.

Thank you very much for help! :)
 
  • #4
145
3
b* not be in the 4th word
 

Related Threads on Find the bit string for the following sets.

Replies
2
Views
5K
  • Last Post
Replies
5
Views
2K
  • Last Post
Replies
1
Views
3K
Replies
1
Views
1K
Replies
0
Views
2K
Replies
1
Views
1K
Replies
22
Views
4K
  • Last Post
Replies
8
Views
2K
  • Last Post
Replies
1
Views
1K
  • Last Post
Replies
20
Views
4K
Top