Which of the following is true for an anti-reflexive relation?
Correct answer:
B) No element in the set is related to itself
Explanation: In an anti-reflexive relation, no element in the set can be related to itself.
Which of the following is true for an anti-reflexive relation?
Correct answer:
B) No element in the set is related to itself
Explanation: In an anti-reflexive relation, no element in the set can be related to itself.
In Boolean algebra, what does the expression A.A simplify to?
Correct answer:
A) A
Explanation: In Boolean algebra, A.A simplifies to A according to the Idempotent Law.
Which of the following is an example of a tautology in propositional logic?
Correct answer:
A) pp
Explanation: pp is a tautology because it is always true, regardless of the truth value of p.
What is the negation of the biconditional statement pq?
Correct answer:
C) (pq)(pq)
Explanation: The negation of a biconditional statement is true when p and q have opposite truth values, which is represented by (pq)(pq).
What is the result of applying the distributive law to p(qr)?
Correct answer:
A) (pq)(pr)
Explanation: The distributive law states that p(qr) is equivalent to (pq)(pr).
Which of the following is an example of a valid argument form?
Correct answer:
B) pq,qp
Explanation: This is an example of Modus Tollens, a valid argument form that concludes p from pq and q.
Which of the following is true for a simple graph?
Correct answer:
A) It contains no parallel edges and no loops
Explanation: A simple graph is a graph that has no parallel edges or loops.
Which of the following best describes a complete graph?
Correct answer:
A) Every vertex is connected to every other vertex
Explanation: In a complete graph, each vertex is directly connected to every other vertex.
What is the degree sequence of a graph?
Correct answer:
C) A list of vertices in order of decreasing degree
Explanation: The degree sequence is a list of the degrees of all vertices in non-increasing order.
What is a bipartite graph?
Correct answer:
A) A graph where vertices can be divided into two sets such that no edges exist within the same set
Explanation: A bipartite graph divides vertices into two sets such that edges only exist between vertices from different sets.
Which of the following is an example of a reflexive relation on set A?
Correct answer:
B) (a,a)A for all aA
Explanation: A relation is reflexive if every element is related to itself, meaning (a,a) is in the relation for all a.
Which of the following is an example of 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 relation is transitive if whenever one element is related to a second, and the second is related to a third, the first is related to the third.
What is the Hasse diagram used for?
Correct answer:
A) To represent a partially ordered set
Explanation: A Hasse diagram is used to represent the structure of a partially ordered set, showing the relationships between elements.
Which of the following is an example of a strict order?
Correct answer:
C) a<b, and there are no self-loops
Explanation: A strict order is a transitive, anti-reflexive relation where no element is related to itself.
Which of the following describes an equivalence relation?
Correct answer:
A) Reflexive, symmetric, and transitive
Explanation: An equivalence relation is one that is reflexive, symmetric, and transitive.
Which of the following describes a strict partial order?
Correct answer:
A) It is a relation that is antisymmetric and transitive
Explanation: A strict partial order is a relation that is both antisymmetric and transitive, meaning no element is related to itself and the relation is preserved through transitivity.
Which of the following is a characteristic of a directed acyclic graph (DAG)?
Correct answer:
A) It contains no cycles
Explanation: A directed acyclic graph (DAG) has no cycles, meaning it is impossible to return to a vertex by following edges in the graph.
Which of the following is a property of a spanning tree?
Correct answer:
A) It is a subgraph that contains all vertices and has no cycles
Explanation: A spanning tree is a subgraph that includes all the vertices of the original graph and is acyclic.
What is the result of performing breadth-first search (BFS) on a graph?
Correct answer:
A) A tree that explores the graph by distance from the start vertex
Explanation: Breadth-first search explores the graph by expanding the tree to include vertices that are closest to the start vertex.
Which of the following best describes Prim's algorithm?
Correct answer:
B) It finds the minimum spanning tree by starting at a vertex and growing the tree by adding the smallest edge
Explanation: Prim's algorithm is a greedy algorithm that finds the minimum spanning tree by starting at a vertex and adding the smallest possible edge to grow the tree.
Which of the following is true for a matrix that has an inverse?
Correct answer:
B) It is a nonsingular matrix
Explanation: A nonsingular matrix is a square matrix that has an inverse, meaning it can be multiplied by another matrix to yield the identity matrix.
Which of the following describes a diagonal matrix?
Correct answer:
C) A square matrix where all non-diagonal entries are zero
Explanation: A diagonal matrix is a square matrix where the only nonzero entries are along the main diagonal.
Which of the following is a valid operation when multiplying matrices?
Correct answer:
A) The number of columns in the first matrix must equal the number of rows in the second matrix
Explanation: For matrix multiplication to be defined, the number of columns in the first matrix must match the number of rows in the second matrix.
What is the identity matrix?
Correct answer:
B) A diagonal matrix where all diagonal elements are 1
Explanation: The identity matrix is a diagonal matrix with 1s on the diagonal and 0s elsewhere. It acts as the multiplicative identity in matrix multiplication.
What is Gaussian elimination used for in matrix operations?
Correct answer:
B) To reduce a matrix to row echelon form
Explanation: Gaussian elimination is a method used to reduce a matrix to row echelon form by applying a series of row operations.
What is the rank of a matrix?
Correct answer:
A) The number of non-zero rows in its row echelon form
Explanation: The rank of a matrix is the number of non-zero rows in its row echelon form, which represents the dimension of the row space.
Which of the following describes an augmented matrix?
Correct answer:
A) A matrix that includes an extra column representing the constants from a system of equations
Explanation: An augmented matrix is formed by appending the constant terms from a system of linear equations to the coefficient matrix.
Which of the following is true for the sum of a finite geometric series?
Correct answer:
A) It converges if the common ratio is less than 1
Explanation: The sum of a finite geometric series converges if the common ratio is less than 1.
Which of the following describes a harmonic series?
Correct answer:
B) A series that diverges to infinity
Explanation: A harmonic series grows very slowly but diverges to infinity.
Which of the following is an example of an arithmetic sequence?
Correct answer:
A) 1, 3, 5, 7,
Explanation: An arithmetic sequence is one where each term is obtained by adding a constant value to the previous term, as in 1, 3, 5, 7,
What is the common difference in the arithmetic sequence 2, 5, 8, 11, ?
Correct answer:
C) 3
Explanation: The common difference in this arithmetic sequence is 3, as each term is obtained by adding 3 to the previous term.
Which of the following describes a geometric sequence?
Correct answer:
A) A sequence in which each term is multiplied by a constant to obtain the next term
Explanation: A geometric sequence is one in which each term is obtained by multiplying the previous term by a constant factor.
What is the explicit formula for the geometric sequence 3, 6, 12, 24, ...?
Correct answer:
A) an=3.2n1
Explanation: The explicit formula for a geometric sequence is an=a1.rn1, where a1 is the first term and r is the common ratio.
Which of the following best describes a finite series?
Correct answer:
A) A series with a limited number of terms
Explanation: A finite series is a series that has a specific number of terms.
Which of the following is true for the sum of an infinite geometric series?
Correct answer:
A) It converges if the common ratio is less than 1
Explanation: An infinite geometric series converges if the absolute value of the common ratio is less than 1.
Which of the following is an example of a bijection?
Correct answer:
A) A function that is injective and surjective
Explanation: A bijection is a function that is both injective and surjective (onto).
Which of the following is true for the inverse of a function?
Correct answer:
C) It exists if the function is bijective
Explanation: A function has an inverse if it is bijective, meaning it is both injective and surjective.
Which of the following is an example of an injective function?
Correct answer:
A) A function where each element in the domain maps to a unique element in the codomain
Explanation: An injective function is one where no two distinct elements in the domain map to the same element in the codomain.
Which of the following describes a surjective function?
Correct answer:
A) A function where every element in the codomain has at least one preimage
Explanation: A surjective function is one where every element in the codomain is the image of at least one element from the domain.
Which of the following is an example of a function that is both injective and surjective?
Correct answer:
A) A bijection
Explanation: A bijection is a function that is both injective (one-to-one) and surjective (onto).
Which of the following describes a binary relation from set A to set B?
Correct answer:
A) A subset of AB
Explanation: A binary relation from set A to set B is a subset of the Cartesian product AB, where elements from A are related to elements from B.
Which of the following is an example of a reflexive relation?
Correct answer:
A) (a,a)A for all aA
Explanation: A reflexive relation requires that every element in the set is related to itself, meaning (a,a)A for all aA.
Which of the following is an example of an antisymmetric relation?
Correct answer:
A) If a is related to b and b is related to a, then a=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.
Which of the following is an example of 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 one element is related to a second and the second is related to a third, the first is related to the third.
Which of the following is an example of an equivalence class?
Correct answer:
A) The set of elements that are related to a given element by an equivalence relation
Explanation: An equivalence class is the set of elements that are related to a given element by an equivalence relation.
Which of the following describes a partition of a set?
Correct answer:
A) A collection of subsets of the set that are pairwise disjoint and whose union is the original set
Explanation: A partition of a set divides the set into non-overlapping subsets whose union equals the original set.
Which of the following is an example of a function that is not injective?
Correct answer:
A) A function where multiple elements in the domain map to the same element in the codomain
Explanation: A function is not injective if two or more distinct elements in the domain map to the same element in the codomain.
Which of the following is true for the composition of two functions?
Correct answer:
D) All of the above
Explanation: The composition of two injective functions is injective, the composition of two surjective functions is surjective, and the composition of two bijective functions is bijective.
Which rule of inference concludes q from the premises p -> q and p?
Correct answer:
D) Modus ponens
Explanation: Modus ponens: if p implies q, and p is true, then q is true.
Which rule of inference concludes NOT p from p -> q and NOT q?
Correct answer:
B) Modus tollens
Explanation: Modus tollens: if p implies q and q is false, then p must be false.
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.