50 multiple-choice questions with answers and detailed explanations. Untimed — choose an answer to check it instantly.
0/50 answered0 correct
Question 1 of 50
Which of the following best describes a relation from set A to set B?
Correct answer: A) A subset of the Cartesian product AB
Explanation: A relation from set A to set B is a subset of the Cartesian product AB, which consists of ordered pairs where the first element is from A and the second element is from B.
Question 2 of 50
Which of the following describes the codomain of a function?
Correct answer: A) The set of possible output values
Explanation: The codomain of a function is the set of possible output values that the function can map to, though not every element in the codomain must have a corresponding element in the domain.
Question 3 of 50
What is the range of a function?
Correct answer: A) The set of all images of elements in the domain
Explanation: The range of a function is the set of actual output values (or images) that are mapped from the elements of the domain.
Question 4 of 50
Which of the following is an example of an injective function?
Correct answer: A) Every element of the domain maps to a unique element of the codomain
Explanation: An injective function is one in which distinct elements in the domain map to distinct elements in the codomain.
Question 5 of 50
Which of the following best describes a surjective function?
Correct answer: A) Every element of the codomain has at least one preimage
Explanation: A surjective function (or onto function) ensures that every element of the codomain is the image of at least one element in the domain.
Question 6 of 50
What is a bijection?
Correct answer: A) A function that is both injective and surjective
Explanation: A bijection is a function that is both injective (one-to-one) and surjective (onto), meaning it establishes a one-to-one correspondence between elements of the domain and the codomain.
Question 7 of 50
Which of the following describes a function composition?
Correct answer: A) The result of applying one function to the result of another function
Explanation: Function composition is the process of applying one function to the result of another function, often written as f(g(x)).
Question 8 of 50
Which of the following describes a binary relation?
Correct answer: A) A subset of the Cartesian product of two sets
Explanation: A binary relation is a subset of the Cartesian product of two sets, representing relationships between pairs of elements from those sets.
Question 9 of 50
Which of the following describes an equivalence class?
Correct answer: A) The set of all elements related to a given element under an equivalence relation
Explanation: An equivalence class consists of all elements that are related to a specific element under an equivalence relation.
Question 10 of 50
What is the purpose of the identity function?
Correct answer: A) To return the same input as the output
Explanation: The identity function is a function that returns the same value as its input, often written as I(x)=x.
Question 11 of 50
What is the inverse of a function?
Correct answer: A) A function that reverses the effect of the original function
Explanation: The inverse of a function undoes the effect of the original function, meaning that applying the function and its inverse successively returns the original input.
Question 12 of 50
Which of the following describes a reflexive relation?
Correct answer: A) Every element in the set is related to itself
Explanation: A reflexive relation is one in which every element is related to itself, meaning for all elements a, (a,a) is in the relation.
Question 13 of 50
Which of the following describes a symmetric relation?
Correct answer: A) If a is related to b, then b is related to a
Explanation: A symmetric relation is one in which if one element is related to another, the reverse relation also holds.
Question 14 of 50
Which of the following describes an antisymmetric relation?
Correct answer: A) If a is related to b and b is related to a, then a=ba = ba=b
Explanation: An antisymmetric relation is one where if A is related to B and B is related to A, then A must equal B.
Question 15 of 50
Which of the following describes a transitive relation?
Correct answer: A) If A is related to B and B is related to C, then A is related to C
Explanation: A transitive relation is one where if A is related to B and B is related to C, then A must also be related to C.
Question 16 of 50
Which of the following describes a strict partial order?
Correct answer: A) A binary relation that is transitive and antisymmetric but not reflexive
Explanation: A strict partial order is a binary relation that is transitive and antisymmetric, meaning it does not contain self-loops.
Question 17 of 50
What is the characteristic property of a total order?
Correct answer: A) Every pair of elements is comparable
Explanation: In a total order, every pair of elements is comparable, meaning one is always either less than or greater than the other.
Question 18 of 50
Which of the following best describes a directed acyclic graph (DAG)?
Correct answer: A) A graph with directed edges and no cycles
Explanation: A directed acyclic graph (DAG) is a graph with directed edges that contains no cycles.
Question 19 of 50
Which of the following best describes a rooted tree?
Correct answer: A) A tree with one designated vertex as the root
Explanation: A rooted tree is a tree with a designated root vertex, from which all other vertices are connected in a hierarchical manner.
Question 20 of 50
What is a spanning tree in a graph?
Correct answer: A) A subgraph that includes all vertices of the original graph and is a tree
Explanation: A spanning tree is a subgraph that includes all vertices of the original graph but contains no cycles, forming a tree.
Question 21 of 50
Which of the following is true for the adjacency matrix of an undirected graph?
Correct answer: A) It is symmetric
Explanation: The adjacency matrix of an undirected graph is symmetric because the graph has undirected edges, meaning the edge from A to B is the same as the edge from B to A.
Question 22 of 50
What is the degree of a vertex in a graph?
Correct answer: A) The number of edges incident to the vertex
Explanation: The degree of a vertex is the number of edges that are incident to it, representing how many edges connect to that vertex.
Question 23 of 50
Which of the following describes a simple graph?
Correct answer: A) A graph with no loops or parallel edges
Explanation: A simple graph is a graph that contains no loops (edges that connect a vertex to itself) and no parallel edges (multiple edges connecting the same pair of vertices).
Question 24 of 50
What does the term "isolated vertex" refer to in graph theory?
Correct answer: A) A vertex that is not connected to any other vertex
Explanation: An isolated vertex is a vertex that has no edges connecting it to any other vertices in the graph.
Question 25 of 50
Which of the following describes an Euler circuit?
Correct answer: A) A circuit that visits every edge of a graph exactly once and returns to the starting vertex
Explanation: An Euler circuit is a closed path that visits every edge of a graph exactly once and returns to the starting vertex.
Question 26 of 50
Which of the following describes a Hamiltonian path?
Correct answer: A) A path that visits every vertex of a graph exactly once
Explanation: A Hamiltonian path is a path that visits every vertex of a graph exactly once without revisiting any vertices.
Question 27 of 50
Which of the following is a key property of a bipartite graph?
Correct answer: A) Its vertex set can be divided into two disjoint sets such that no two vertices within the same set are adjacent
Explanation: A bipartite graph is a graph whose vertices can be divided into two disjoint sets such that no two vertices within the same set are adjacent.
Question 28 of 50
What does the Pigeonhole Principle state?
Correct answer: A) If n+1 or more objects are placed into n boxes, at least one box must contain more than one object
Explanation: The Pigeonhole Principle states that if more objects than containers are available, at least one container must hold more than one object.
Question 29 of 50
Which of the following is true for a permutation of a set?
Correct answer: A) It is an ordered arrangement of all elements in the set
Explanation: A permutation of a set is an ordered arrangement of all the elements in the set.
Question 30 of 50
Which of the following describes an r-combination of a set?
Correct answer: A) An unordered selection of r elements from the set
Explanation: An r-combination of a set is an unordered selection of r elements from the set, where order does not matter.
Question 31 of 50
Which of the following describes a power set?
Correct answer: A) The set of all subsets of a given set
Explanation: The power set of a set is the set of all its subsets, including the empty set and the set itself.
Question 32 of 50
Which of the following describes the union of two sets?
Correct answer: A) The set of all elements that are in either set or in both sets
Explanation: The union of two sets is the set of all elements that are in either set or in both sets.
Question 33 of 50
Which of the following describes the intersection of two sets?
Correct answer: A) The set of elements that are in both sets
Explanation: The intersection of two sets is the set of elements that are common to both sets.
Question 34 of 50
What is the complement of a set?
Correct answer: A) The set of all elements in the universal set that are not in the given set
Explanation: The complement of a set is the set of all elements in the universal set that are not in the given set.
Question 35 of 50
Which of the following describes a Cartesian product?
Correct answer: A) The set of all ordered pairs formed by taking one element from each of two sets
Explanation: The Cartesian product of two sets is the set of all ordered pairs formed by taking one element from the first set and one from the second set.
Question 36 of 50
What is the principle of inclusion-exclusion?
Correct answer: A) A formula used to calculate the size of the union of two or more sets by subtracting the sizes of the intersections
Explanation: The principle of inclusion-exclusion is a formula used to calculate the size of the union of two or more sets by subtracting the sizes of their intersections.
Question 37 of 50
Which of the following describes a free variable in a predicate?
Correct answer: A) A variable that is not bound by a quantifier
Explanation: A free variable in a predicate is a variable that is not bound by a quantifier, meaning it can take on any value within its domain.
Question 38 of 50
Which of the following describes a bound variable in a predicate?
Correct answer: A) A variable that is bound by a quantifier
Explanation: A bound variable in a predicate is a variable that is restricted by a quantifier, meaning it is associated with a specific condition or range of values.
Question 39 of 50
What does the term "tautology" mean in logic?
Correct answer: A) A proposition that is always true
Explanation: A tautology is a proposition that is always true, regardless of the truth values of its individual components.
Question 40 of 50
Which of the following best describes a contradiction in logic?
Correct answer: A) A proposition that is always false
Explanation: A contradiction is a proposition that is always false, regardless of the truth values of its individual components.
Question 41 of 50
What is De Morgan's Law in logic?
Correct answer: A) A set of rules that describe how negations interact with conjunctions and disjunctions
Explanation: De Morgan's Law describes how negations distribute over conjunctions and disjunctions, specifically: (pq) = pq and (pq) = pq.
Question 42 of 50
Which of the following is true for an existential quantifier?
Correct answer: A) It asserts that there exists at least one element in the domain for which the predicate is true
Explanation: The existential quantifier x asserts that there is at least one element in the domain for which the predicate P(x) is true.
Question 43 of 50
What does the universal quantifier assert?
Correct answer: A) The predicate is true for all elements in the domain
Explanation: The universal quantifier x asserts that the predicate P(x) is true for every element in the domain.
Question 44 of 50
Which of the following describes a proof by contradiction?
Correct answer: A) Assuming the negation of the statement to be proved and deriving a contradiction
Explanation: A proof by contradiction assumes the negation of the statement to be proved and then shows that this assumption leads to a contradiction, thereby proving the original statement.
Question 45 of 50
Which of the following describes a direct proof?
Correct answer: A) Proving a statement by directly showing that the hypothesis leads to the conclusion
Explanation: A direct proof involves starting with the hypothesis and making logical steps that lead to the conclusion.
Question 46 of 50
What is the purpose of a proof by contrapositive?
Correct answer: A) To prove a statement by proving its contrapositive, qp
Explanation: A proof by contrapositive involves proving the contrapositive of a statement, which is logically equivalent to proving the original statement.
Question 47 of 50
Which of the following best describes a proof by exhaustion?
Correct answer: A) A proof that verifies a statement by checking all possible cases
Explanation: A proof by exhaustion involves checking all possible cases to verify that the statement holds for each one.
Question 48 of 50
Which of the following describes a mathematical induction proof?
Correct answer: A) A proof that involves a base case and an inductive step
Explanation: A proof by mathematical induction involves proving a base case and then showing that if the statement holds for one case, it holds for the next case.
Question 49 of 50
Which of the following is the base case in mathematical induction?
Correct answer: A) The initial case for which the statement is proven to be true
Explanation: The base case in mathematical induction is the initial case where the statement is directly proven to be true, forming the foundation for the inductive step.
Question 50 of 50
Which of the following is true for strong mathematical induction?
Correct answer: A) The inductive step assumes the statement is true for all previous cases up to the current one
Explanation: In strong mathematical induction, the inductive step assumes that the statement is true for all previous cases up to the current one, rather than just for one prior case.
Set 4 complete
You scored 0%
0 correct out of 0 answered (50 questions in this set).