Scribd
Upload
88 views4 pages

Concept Review - Chapter 2

The document defines key concepts related to sets including: subsets, unions, intersections, differences, functions, bijections, power sets, cardinality, and binary representations of subsets. It then provides 19 multiple choice questions testing understanding of these concepts. The questions cover topics like determining subset representations, evaluating set operations like unions and differences, identifying function properties, calculating cardinalities, and solving problems involving power sets.

Uploaded by

Vũ Thái Anh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
88 views4 pages

Concept Review - Chapter 2

The document defines key concepts related to sets including: subsets, unions, intersections, differences, functions, bijections, power sets, cardinality, and binary representations of subsets. It then provides 19 multiple choice questions testing understanding of these concepts. The questions cover topics like determining subset representations, evaluating set operations like unions and differences, identifying function properties, calculating cardinalities, and solving problems involving power sets.

Uploaded by

Vũ Thái Anh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Concept review – Chapter 2

 b  A means b is a/an ____ of the ____ A.


 If every element of S is also an element of T, we say S is a ____ of T.
 The ___ set  is the set with ____ elements.
 A ∪ B: the ____ of A and B.
 A ∩ B: the ____ of A and B.
 A − B (the difference of A and B): the set containing elements that are in A ___ in B.
 A ⊕ B (the symmetric difference of A and B): the set containing elements in ____ A and
B.
 A function from A to B maps ____ element of A to ____ element of B.
 If a function is both onto and one-to-one, it is called a ____.
 If a function is a bijection, it has an ____ function. It’s also called an invertible function.

Some multiple choice questions

1. Let U = {a, b, c, d, e, f, g, h, i, j}. The bit string representing the subset {a, c, d, g, h, i} is
____
a. 10 1110 1110
b. 10 1101 1110
c. 10 1100 1011
d. 10 1100 1110
2. Let U = {a, b, c, d, e, f, g, h, i, j}.
Given the subsets A = {a, c, d, e, i}, B = {a, f, g, h, j}. The bit string representing the
subset A - B is_______
a. 01 0110 0010
b. 00 1011 0010
c. 00 1110 0010
d. 00 0111 1010
3. Let M be the set {(a, b) | a - 1 = b}, where a and b are in {-2, -1, 0, 1, 2}. How many
elements does R have? (or in other words, what is the cardinality of M ?)
a. 4
b. 3
c. 2
d. 1
4. The set A has n elements, B has n+1 elements. Assume that A  B has 42 elements. Find
n.
5. Given the sequence {an, n = 1, 2, …}: an = 1 + 2 + 3 + … + n. Find a7 – a6.
a. 7
b. 6
c. 1
d. n
e. None of these
6. Given the sequence {an, n = 1, 2, …} where an equals the number of 1 bits in the
binary format of n. Find a11.
a. 0
b. 1
c. 2
d. 3
e. 4
f. None of these
7.

8. Which statement is FALSE?Ⴖ


a. A  A = 
b. A  A = A
c. A  Á = U, where U is the universal set.
9.

10.
a. f is onto but not one-to-one.
b. f is a bijection.
c. f is one-to-one but not onto.
d. None of these.
11.

a. f is one-to-one but not onto.


b. f is onto but not one-to-one.
c. f is both one-to-one and onto.
d. f is neither one-to-one nor onto.

12. Find the composite function (fg)(x) = f(g(x)),


where f(x) = x + 2018 and g(x) = x2018.

(i) (x+2018)2018
(ii) x2018 + 2018
(iii) x2018(x+2018)
(iv)None of these
13. Given A = {1, 2}. Find A - P(A). (Recall that P(A) is the power set of A)
a. 
b. A
c. {  }
d. None of these
14. Given A = {1, 2}, find A  P(A).
a. A
b. 
c. {  }
d. None of these
15. How many elements does the set P({1, 2, 3, 4, 5, 6, 7, 8}) have?
a. 8
b. 16
c. 256
d. None of these
16.

17.

18.

19. Which sum is largest?

You might also like