UNIT SF: Multiple Choice Questions

Lectures in Discrete Mathematics, Course 1, Bender/Williamson Review Questions

Multiple Choice Questions for Review

In each case there is one correct answer (given at the end of the problem set). Try
to work the problem first without looking at the answer. Understand both why the
correct answer is correct and why the other answers are wrong.

1. Which of the following statements is FALSE?

(a) 2 ∈ A ∪ B implies that if 2 ∈
/ A then 2 ∈ B.
(b) {2, 3} ⊆ A implies that 2 ∈ A and 3 ∈ A.
(c) A ∩ B ⊇ {2, 3} implies that {2, 3} ⊆ A and {2, 3} ⊆ B.
(d) A − B ⊇ {3} and {2} ⊆ B implies that {2, 3} ⊆ A ∪ B.
(e) {2} ∈ A and {3} ∈ A implies that {2, 3} ⊆ A.
2. Let A = {0, 1} × {0, 1} and B = {a, b, c}. Suppose A is listed in lexicographic order
based on 0 < 1 and B is in alphabetic order. If A × B × A is listed in lexicographic
order, then the next element after ((1, 0), c, (1, 1)) is
(a) ((1, 0), a, (0, 0))
(b) ((1, 1), c, (0, 0))
(c) ((1, 1), a, (0, 0))
(d) ((1, 1), a, (1, 1))
(e) ((1, 1), b, (1, 1))
3. Which of the following statements is TRUE?
(a) For all sets A, B, and C, A − (B − C) = (A − B) − C.
(b) For all sets A, B, and C, (A − B) ∩ (C − B) = (A ∩ C) − B.
(c) For all sets A, B, and C, (A − B) ∩ (C − B) = A − (B ∪ C).
(d) For all sets A, B, and C, if A ∩ C = B ∩ C then A = B.
(e) For all sets A, B, and C, if A ∪ C = B ∪ C then A = B.
4. Which of the following statements is FALSE?
(a) C − (B ∪ A) = (C − B) − A
(b) A − (C ∪ B) = (A − B) − C
(c) B − (A ∪ C) = (B − C) − A
(d) A − (B ∪ C) = (B − C) − A
(e) A − (B ∪ C) = (A − C) − B
5. Consider the true theorem, “For all sets A and B, if A ⊆ B then A ∩ B c = ∅.” Which
of the following statements is NOT equivalent to this statement:
(a) For all sets Ac and B, if A ⊆ B then Ac ∩ B c = ∅.
(b) For all sets A and B, if Ac ⊆ B then Ac ∩ B c = ∅.

SF-29
Sets and Functions

(c) For all sets Ac and B c , if A ⊆ B c then A ∩ B = ∅.

(d) For all sets Ac and B c , if Ac ⊆ B c then Ac ∩ B = ∅.
(e) For all sets A and B, if Ac ⊇ B then A ∩ B = ∅.
6. The power set P((A × B) ∪ (B × A)) has the same number of elements as the power
set P((A × B) ∪ (A × B)) if and only if
(a) A = B
(b) A = ∅ or B = ∅
(c) B = ∅ or A = B
(d) A = ∅ or B = ∅ or A = B
(e) A = ∅ or B = ∅ or A ∩ B = ∅
7. Let σ = 452631 be a permutation on {1, 2, 3, 4, 5, 6} in one-line notation (based on the
usual order on integers). Which of the following is NOT a correct cycle notation for
σ?
(a) (614)(532)
(b) (461)(352)
(c) (253)(146)
(d) (325)(614)
(e) (614)(253)
8. Let f : X → Y . Consider the statement, “For all subsets C and D of Y , f −1 (C ∩D c ) =
f −1 (C) ∩ [f −1 (D)]c . This statement is
(a) True and equivalent to:
For all subsets C and D of Y , f −1 (C − D) = f −1 (C) − f −1 (D).
(b) False and equivalent to:
For all subsets C and D of Y , f −1 (C − D) = f −1 (C) − f −1 (D).
(c) True and equivalent to:
For all subsets C and D of Y , f −1 (C − D) = f −1 (C) − [f −1 (D)]c.
(d) False and equivalent to:
For all subsets C and D of Y , f −1 (C − D) = f −1 (C) − [f −1 (D)]c.
(e) True and equivalent to:
For all subsets C and D of Y , f −1 (C − D) = [f −1 (C)]c − f −1 (D).
1−(−1)n
9. Define f (n) = n2 + 4
for all n ∈ Z. Thus, f : Z → Z, Z the set of all integers.
Which is correct?
n
(a) f is not a function from Z → Z because 2
/ Z.
∈
(b) f is a function and is onto and one-to-one.
(c) f is a function and is not onto but is one-to-one.
(d) f is a function and is not onto and not one-to-one

SF-30
 Review Questions

(e) f is a function and is onto but not one-to-one.

10. The number of partitions of {1, 2, 3, 4, 5} into three blocks is S(5, 3) = 25. The total
number of functions f : {1, 2, 3, 4, 5} → {1, 2, 3, 4} with |Image(f)| = 3 is
(a) 4 × 6
(b) 4 × 25
(c) 25 × 6
(d) 4 × 25 × 6
(e) 3 × 25 × 6
11. Let f : X → Y and g : Y → Z. Let h = g ◦ f : X → Z. Suppose g is one-to-one and
onto. Which of the following is FALSE?
(a) If f is one-to-one then h is one-to-one and onto.
(b) If f is not onto then h is not onto.
(c) If f is not one-to-one then h is not one-to-one.
(d) If f is one-to-one then h is one-to-one.
(e) If f is onto then h is onto.
12. Which of the following statements is FALSE?
(a) {2, 3, 4} ⊆ A implies that 2 ∈ A and {3, 4} ⊆ A.
(b) {2, 3, 4} ∈ A and {2, 3} ∈ B implies that {4} ⊆ A − B.
(c) A ∩ B ⊇ {2, 3, 4} implies that {2, 3, 4} ⊆ A and {2, 3, 4} ⊆ B.
(d) A − B ⊇ {3, 4} and {1, 2} ⊆ B implies that {1, 2, 3, 4} ⊆ A ∪ B.
(e) {2, 3} ⊆ A ∪ B implies that if {2, 3} ∩ A = ∅ then {2, 3} ⊆ B.
13. Let A = {0, 1} × {0, 1} × {0, 1} and B = {a, b, c} × {a, b, c} × {a, b, c}. Suppose A
is listed in lexicographic order based on 0 < 1 and B is listed in lexicographic order
based on a < b < c. If A × B × A is listed in lexicographic order, then the next element
after ((0, 1, 1), (c, c, c), (1, 1, 1)) is
(a) ((1, 0, 1), (a, a, b), (0, 0, 0))
(b) ((1, 0, 0), (b, a, a), (0, 0, 0))
(c) ((1, 0, 0), (a, a, a), (0, 0, 1))
(d) ((1, 0, 0), (a, a, a), (1, 0, 0))
(e) ((1, 0, 0), (a, a, a), (0, 0, 0))
14. Consider the true theorem, “For all sets A, B, and C if A ⊆ B ⊆ C then C c ⊆ B c ⊆
Ac .” Which of the following statements is NOT equivalent to this statement:
(a) For all sets Ac , B c , and C c , if Ac ⊆ B c ⊆ C c then C ⊆ B ⊆ A.
(b) For all sets Ac , B, and C c , if Ac ⊆ B ⊆ C c then C ⊆ B c ⊆ A.
(c) For all sets A, B, and C c , if Ac ⊆ B ⊆ C then C c ⊆ B c ⊆ A.

SF-31
Sets and Functions

(d) For all sets Ac , B, and C c , if Ac ⊆ B c ⊆ C then C c ⊆ B c ⊆ A.

(e) For all sets Ac , B c , and C c , if Ac ⊆ B c ⊆ C then C c ⊆ B ⊆ A.
15. Let P(A) denote the power set of A. If P(A) ⊆ B then
(a) 2|A| ≤ |B|
(b) 2|A| ≥ |B|
(c) 2|A| < |B|
(d) |A| + 2 ≤ |B|
(e) 2|A| ≥ 2|B|
16. Let f : {1, 2, 3, 4, 5, 6, 7, 8, 9} → {a, b, c, d, e}. In one-line notation, f = (e, a, b, b, a, c, c, a, c)
(use number order on the domain). Which is correct?
(a) Image(f ) = {a, b, c, d, e}, Coimage(f ) = {{6, 7, 9}, {2, 5, 8}, {3, 4}, {1}}
(b) Image(f ) = {a, b, c, e}, Coimage(f ) = {{6, 7, 9}, {2, 5, 8}, {3, 4}}
(c) Image(f ) = {a, b, c, e}, Coimage(f ) = {{6, 7, 9}, {2, 5, 8}, {3, 4}, {1}}
(d) Image(f ) = {a, b, c, e}, Coimage(f ) = {{6, 7, 9, 2, 5, 8}, {3, 4}, {1}}
(e) Image(f ) = {a, b, c, d, e}, Coimage(f ) = {{1}, {3, 4}, {2, 5, 8}, {6, 7, 9}}
17. Let Σ = {x, y} be an alphabet. The strings of length seven over Σ are listed in
dictionary (lex) order. What is the first string after xxxxyxx that is a palindrome
(same read forwards and backwards)?

(a) xxxxyxy (b) xxxyxxx (c) xxyxyxx (d) xxyyyxx (e) xyxxxyx

18. Let σ = 681235947 and τ = 627184593 be permutations on {1, 2, 3, 4, 5, 6, 7, 8, 9} in

one-line notation (based on the usual order on integers). Which of the following is a
correct cycle notation for τ ◦ σ?
(a) (124957368)
(b) (142597368)
(c) (142953768)
(d) (142957368)
(e) (142957386)

Answers: 1 (e), 2 (c), 3 (b), 4 (d), 5 (a), 6 (d), 7 (b), 8 (a), 9 (e), 10 (d), 11 (a),
12 (b), 13 (e), 14 (d), 15 (a), 16 (c), 17 (b), 18 (d).

SF-32
 Notation Index

∀ (for all) SF-16 Set notation

B A
(all functions) SF-16 {x : · · ·} (set description) SF-2
{x | · · ·} (set description) SF-2
|B | = |B||A| (all functions) SF-18
A
∅ (empty set) SF-2
(n)k (falling factorial) SF-9 ∼A (complement) SF-2
a R b (binary relation) SF-16 ∈ and 6∈ (in and not in) SF-1
n!
C(n, k) = k! (n−k)! (binomial ×k A (k-fold product) SF-2
coefficient) SF-9 A′ (complement) SF-2
A − B (difference) SF-2
n! (n factorial) SF-9 A ∩ B (intersection) SF-2
n n!


k
= k! (n−k)! (binomial A ∪ B (union) SF-2
coefficient) SF-9 A ⊕ B (symmetric
Bn (Bell number) SF-11 difference) SF-2
A \ B (difference) SF-2
χ (characteristic function) SF-10
A ⊆ B (subset) SF-1
∃! (for exactly one) SF-16 A × B (Cartesian product) SF-2
∃ (for some) SF-16 Ac (complement) SF-2
Function P(A) (set of subsets of A) SF-9
χ (characteristic) SF-10 Pk (A) (set of k-subsets of
n


C(n, k) = k (binomial A) SF-9
coefficient) SF-9 |A| (cardinality) SF-1
PER(A) = S(A) Sets of numbers
(permutations) SF-18 n = {1, 2, . . . , n} SF-16
Coimage(f ) SF-23 S(n, k) (Stirling number) SF-24
Image(f ) SF-23
Function notation
B A (all functions) SF-16, SF-17,
SF-18
f : A → B (a function) SF-15
f −1 (inverse, 6= 1/f ) SF-18
g ◦ f (composition) SF-20
∃! (for exactly one) SF-16
∃ (for some) SF-16
∀ (for all) SF-16
n = {1, 2, . . . , n} SF-16
P(A) (set of subsets of A) SF-9
Pk (A) (set of k-subsets of A) SF-9
PER(A) = S(A) (permutations) SF-18

Index-1
 Index

Subject Index

Absorption rule SF-3 Distributive rule SF-3

Algebraic rules for Domain of a function SF-15
sets SF-2 Double negation rule SF-3
Associative law
functional composition SF-20
Associative rule SF-3 Element method of proof SF-4
Empty set SF-2
Encryption SF-19
Bell number SF-11
Envelope game SF-17
Bijective function SF-18
Binomial coefficient
Pascal’s triangle SF-10 Factorial
recursion SF-10 falling SF-9
Binomial
coefficient: C(n, k) = Falling factorial SF-9
n
k
SF-9
Function SF-15
Block of a partition SF-11 bijective SF-18
binomial coefficient: nk =

C(n, k) SF-9
Cardinality of a set SF-1 characteristic: χ SF-10
Cartesian product of sets SF-2 codomain (= range) of SF-15
coimage and set partition SF-23
Characteristic function SF-10
coimage of SF-23
Codomain of a function SF-15 composition of SF-20, SF-20
Coimage of a function SF-23 domain of SF-15
set partition SF-23 hash SF-19
Commutative rule SF-3 image of SF-15, SF-23
injective SF-18
Complement of a set SF-2
inverse SF-18, SF-23
Composition of functions SF-20, number of SF-18
SF-20 number of = nk S(m, k) k! SF-25


associative law SF-20 one-line notation for SF-16,
Cryptography SF-19 SF-16
Cycle form of a permutation SF-22 one-to-one (= injection) SF-18
onto (= surjection) SF-18
permutation SF-18
range (= codomain) of SF-15
DeMorgan’s rule SF-3
surjective SF-18
DES (= Data Encryption two-line notation for SF-20,
Standard) SF-19 SF-20
Dictionary order (= lex order) SF-8 Functional relation SF-16
Difference of sets SF-2
symmetric SF-2

Index-3
Index

Hashing SF-19 PGP (= Pretty Good

Privacy) SF-19
Power set SF-9
Idempotent rule SF-3
Product of sets SF-2
Image of a function SF-15, SF-23
Injective function SF-18
Intersection of sets SF-2 Range of a function SF-15
Inverse function SF-18 Refinement of set partition SF-11
Inverse relation SF-16 Relation SF-16
functional SF-16
inverse SF-16
Lexicographic order (= lex order SF-8
order) SF-7 Rule
Linear order SF-1 absorption SF-3
associative SF-3
List (= ordered set) SF-1 commutative SF-3
DeMorgan’s SF-3
distributive SF-3
Number double negation SF-3
Bell number: Bn SF-11 idempotent SF-3
binomial coefficient: nk =

C(n, k) SF-9
Stirling: S(n, k) SF-24 Set SF-1
algebraic method SF-5
algebraic rules SF-2
One-line notation SF-16, SF-16 Bell number: Bn SF-11
One-to-one function (= injection) SF-18 cardinality of SF-1
Onto function (= surjection) SF-18 Cartesian product SF-2
characteristic function SF-10
Order
complement SF-2
dictionary (= lex) SF-8
difference SF-2
lex (= lexicographic) SF-7
element method SF-4
linear SF-1
empty SF-2
relation SF-8
intersection SF-2
Ordered set SF-1 number of subsets SF-11
ordered SF-1
power SF-9
Partition of a set SF-11 subset SF-1
block of SF-11 symmetric difference SF-2
function coimage and SF-23 union SF-2
number of SF-11, SF-24 universal SF-1
refinement of SF-11 Venn diagrams SF-3
Pascal’s triangle SF-10 Set partition SF-11
Permutation SF-18 block of SF-11
cycle SF-22 function coimage and SF-23
cycle form SF-22 refining SF-11
cycle length SF-22 Stirling number: S(n, k) SF-24

Index-4
 Index

Stirling number S(n, k) SF-24

String (= ordered set) SF-1
Subset of a set SF-1
number of them SF-11
Surjective function SF-18
Symmetric difference of sets SF-2

Two-line notation SF-20, SF-20

Union of sets SF-2

Universal set SF-1

Vector (= ordered set) SF-1

Venn diagrams for sets SF-3

Word (= ordered set) SF-1

Index-5