What is a set in discrete mathematics?
Correct answer:
A) A well-defined collection of distinct objects
Explanation: A set is a well-defined collection of distinct objects called elements. Order does not matter and duplicates are not counted.
What is a set in discrete mathematics?
Correct answer:
A) A well-defined collection of distinct objects
Explanation: A set is a well-defined collection of distinct objects called elements. Order does not matter and duplicates are not counted.
Which symbol denotes that an element belongs to a set?
Correct answer:
B) ∈
Explanation: The symbol ∈ means 'is an element of.' For example, 3 ∈ {1, 2, 3} states that 3 belongs to the set.
What is the empty set?
Correct answer:
C) A set containing no elements
Explanation: The empty set, denoted ∅ or {}, contains no elements. It is a subset of every set.
What does it mean for set A to be a subset of set B?
Correct answer:
D) Every element of A is also an element of B
Explanation: A ⊆ B means every element of A is also in B. A may equal B; if A is strictly smaller it is a proper subset.
What is the union of two sets A and B?
Correct answer:
A) The set of elements in A or B or both
Explanation: The union A ∪ B contains every element that is in A, in B, or in both.
What is the intersection of two sets A and B?
Correct answer:
B) The set of elements common to both A and B
Explanation: The intersection A ∩ B contains exactly the elements that belong to both A and B.
What is the set difference A minus B?
Correct answer:
C) Elements in A that are not in B
Explanation: The difference A − B (or A \ B) consists of the elements that are in A but not in B.
What is the complement of a set A?
Correct answer:
D) All elements of the universal set not in A
Explanation: The complement of A contains every element of the universal set that is not in A.
What is the cardinality of a set?
Correct answer:
A) The number of elements in the set
Explanation: Cardinality is the number of elements in a set. The set {a, b, c} has cardinality 3.
How many subsets does a set with n elements have?
Correct answer:
B) 2^n
Explanation: A set with n elements has 2^n subsets, since each element is either included or excluded, giving two choices per element.
How many subsets does the set {1, 2, 3} have?
Correct answer:
C) 8
Explanation: With 3 elements the number of subsets is 2^3 = 8, including the empty set and the set itself.
What is the power set of a set A?
Correct answer:
D) The set of all subsets of A
Explanation: The power set P(A) is the set whose elements are all the subsets of A, and it has 2^n members for an n-element set.
What is the Cartesian product A × B?
Correct answer:
A) The set of all ordered pairs (a, b) with a in A and b in B
Explanation: The Cartesian product A × B is the set of all ordered pairs where the first component comes from A and the second from B.
If |A| = 3 and |B| = 4, what is |A × B|?
Correct answer:
B) 12
Explanation: The Cartesian product has |A| times |B| ordered pairs, so 3 × 4 = 12.
What is a relation from set A to set B?
Correct answer:
C) A subset of the Cartesian product A × B
Explanation: A relation from A to B is any subset of A × B, meaning a set of ordered pairs linking elements of A to elements of B.
What is the domain of a relation?
Correct answer:
D) The set of all first components of the ordered pairs
Explanation: The domain is the set of all first elements appearing in the ordered pairs of the relation.
What is the range of a relation?
Correct answer:
A) The set of all second components of the ordered pairs
Explanation: The range is the set of all second elements that appear in the ordered pairs of the relation.
When is a relation R on a set A reflexive?
Correct answer:
B) Every element is related to itself
Explanation: A relation R on A is reflexive if (a, a) is in R for every element a in A.
When is a relation R symmetric?
Correct answer:
C) Whenever (a, b) is in R, (b, a) is also in R
Explanation: A relation is symmetric if for every pair (a, b) in R, the reversed pair (b, a) is also in R.
What is an equivalence relation?
Correct answer:
A) A relation that is reflexive, symmetric, and transitive
Explanation: An equivalence relation satisfies all three properties: reflexivity, symmetry, and transitivity. It partitions a set into equivalence classes.
What does an equivalence relation partition a set into?
Correct answer:
B) Disjoint equivalence classes
Explanation: An equivalence relation divides a set into disjoint equivalence classes whose union is the whole set.
Which relation is an example of an equivalence relation?
Correct answer:
C) Equality (=)
Explanation: Equality is reflexive, symmetric, and transitive, making it an equivalence relation. Less than fails reflexivity and symmetry.
When is a relation antisymmetric?
Correct answer:
D) If (a, b) and (b, a) are both in R, then a equals b
Explanation: A relation is antisymmetric if the only way both (a, b) and (b, a) can be in R is when a = b. Less-than-or-equal is antisymmetric.
What is a partial order relation?
Correct answer:
A) A relation that is reflexive, antisymmetric, and transitive
Explanation: A partial order is reflexive, antisymmetric, and transitive. The subset relation and less-than-or-equal are common examples.
What is a function from set A to set B?
Correct answer:
B) A relation assigning each element of A exactly one element of B
Explanation: A function assigns to each element of the domain A exactly one element of the codomain B.
In a function f from A to B, what is A called?
Correct answer:
C) The domain
Explanation: A is the domain, the set of inputs. B is the codomain, and the actual outputs form the range or image.
What is the codomain of a function?
Correct answer:
D) The set into which the function maps, containing all possible outputs
Explanation: The codomain is the target set B. The range (image) is the subset of the codomain actually produced by the function.
What distinguishes the range from the codomain?
Correct answer:
A) The range is the set of actual outputs; the codomain is all possible outputs
Explanation: The range is the set of values the function actually takes, which is a subset of the codomain. They are equal only for surjective functions.
What is an injective (one-to-one) function?
Correct answer:
B) Different inputs always map to different outputs
Explanation: An injective function maps distinct inputs to distinct outputs: if f(a) = f(b) then a = b.
What is a surjective (onto) function?
Correct answer:
C) Every element of the codomain is the image of some input
Explanation: A surjective function covers the entire codomain: every element of B equals f(a) for at least one a in A.
What is a bijective function?
Correct answer:
D) A function that is both injective and surjective
Explanation: A bijection is both one-to-one and onto, establishing a perfect pairing between domain and codomain. Only bijections have inverses.
Which type of function has an inverse function?
Correct answer:
A) A bijective function
Explanation: A function has an inverse if and only if it is bijective, since each output must correspond to exactly one input and every output must be used.
What is the composition of functions f and g, written (f ∘ g)(x)?
Correct answer:
B) f(g(x))
Explanation: The composition (f ∘ g)(x) means apply g first, then apply f to the result: f(g(x)).
If f(x) = x + 2 and g(x) = 3x, what is (f ∘ g)(x)?
Correct answer:
C) 3x + 2
Explanation: (f ∘ g)(x) = f(g(x)) = f(3x) = 3x + 2, applying g first and then f.
What is the identity function on a set A?
Correct answer:
D) The function that maps every element to itself
Explanation: The identity function id(x) = x maps every element of A to itself and acts as the neutral element for composition.
What is the inverse of the function f(x) = x + 5?
Correct answer:
A) f⁻¹(x) = x − 5
Explanation: To invert f(x) = x + 5, solve y = x + 5 for x, giving x = y − 5, so f⁻¹(x) = x − 5.
A function f maps {1,2,3} to {a,b}. Can f be injective?
Correct answer:
B) No, because there are more inputs than outputs
Explanation: By the pigeonhole principle, mapping 3 inputs to only 2 outputs forces at least two inputs to share an output, so f cannot be injective.
What is the pigeonhole principle?
Correct answer:
C) If n items go into m containers with n greater than m, some container holds more than one
Explanation: The pigeonhole principle states that if more items are placed into fewer containers than items, at least one container must hold more than one item.
Two sets have the same cardinality when there exists between them a:
Correct answer:
D) Bijection
Explanation: Two sets have equal cardinality precisely when a bijection exists between them, pairing their elements one to one.
What is a countably infinite set?
Correct answer:
A) A set that can be put in bijection with the natural numbers
Explanation: A countably infinite set has the same cardinality as the natural numbers, meaning its elements can be listed in a sequence.
Which set is uncountable?
Correct answer:
B) The real numbers
Explanation: The real numbers are uncountable, as Cantor's diagonal argument shows no bijection with the naturals exists. The integers and rationals are countable.
What is the image of a subset under a function?
Correct answer:
C) The set of outputs produced by applying the function to that subset
Explanation: The image of a subset S under f is {f(x) : x in S}, the set of all outputs obtained from elements of S.
What is the preimage of a value y under a function f?
Correct answer:
D) The set of all inputs that map to y
Explanation: The preimage of y is the set of all x in the domain such that f(x) = y.
For a relation represented as a matrix, what does a reflexive relation require?
Correct answer:
A) All diagonal entries are 1
Explanation: In the 0-1 matrix of a relation, reflexivity requires every diagonal entry to be 1, since each element must relate to itself.
For a relation matrix, what does symmetry correspond to?
Correct answer:
B) The matrix equals its own transpose
Explanation: A relation is symmetric exactly when its 0-1 matrix equals its transpose, since (a, b) present implies (b, a) present.
What is a one-to-one correspondence?
Correct answer:
C) Another name for a bijection
Explanation: A one-to-one correspondence is a bijection, pairing each element of one set with exactly one element of another and vice versa.
If f is a function from A to B and g is a function from B to C, the composition g ∘ f maps:
Correct answer:
D) A to C
Explanation: Composing g after f sends an element of A through f into B, then through g into C, so g ∘ f maps A to C.
Which of the following relations on the integers is NOT reflexive?
Correct answer:
A) Strictly less than (<)
Explanation: Strictly less than is not reflexive because no integer is less than itself. Equality, ≤, and divides are all reflexive.
What does it mean for a function to be well-defined?
Correct answer:
B) Each input produces exactly one unambiguous output
Explanation: A function is well-defined when each input in the domain corresponds to exactly one output with no ambiguity.
A function f: A -> B is called injective (one-to-one) when:
Correct answer:
B) Different elements of A always map to different elements of B
Explanation: Injective means f(a1) = f(a2) only when a1 = a2, so no two inputs share an output.
If this exam is giving you a hard time, let us be your helping hand. Contact us, and we'll provide the assistance you need to pass and move forward.