Skip to content
Pass Any WGU OA Exam Now & Pay After You Pass. Contact Us!
  1. Home
  2. WGU Exams
  3. WGU D420
  4. Set 5
WGU D420 · Discrete Math: Logic

WGU D420 Practice Questions – Set 5

50 multiple-choice questions with answers and detailed explanations. Untimed — choose an answer to check it instantly.

Question 1 of 50

What does the term “bijection” mean in the context of functions?

Question 2 of 50

Which of the following is true for a function to be injective?

Question 3 of 50

What is the composition of two functions, f and g ?

Question 4 of 50

Which of the following is a property of a surjective function?

Question 5 of 50

Which of the following statements about a function’s inverse is true?

Question 6 of 50

Which of the following is true for a function to have an inverse?

Question 7 of 50

Which of the following describes a predicate?

Question 8 of 50

Which of the following is true for a relation to be an equivalence relation?

Question 9 of 50

What is the difference between a reflexive and irreflexive relation?

Question 10 of 50

Which of the following is a key characteristic of a symmetric relation?

Question 11 of 50

Which of the following describes an antisymmetric relation?

Question 12 of 50

Which of the following describes the property of transitivity in a relation?

Question 13 of 50

Which of the following describes a directed graph?

Question 14 of 50

Which of the following is a property of an undirected graph?

Question 15 of 50

Which of the following is true about a cycle in graph theory?

Question 16 of 50

Which of the following best describes a walk in graph theory?

Question 17 of 50

Which of the following is true for a spanning tree?

Question 18 of 50

What is a leaf in a tree graph?

Question 19 of 50

What is the height of a tree graph?

Question 20 of 50

What does it mean for a graph to be k-vertex connected?

Question 21 of 50

What is the degree sequence of a graph?

Question 22 of 50

What is an isomorphism between two graphs?

Question 23 of 50

What is the chromatic number of a graph?

Question 24 of 50

Which of the following describes a graph with a cut-vertex?

Question 25 of 50

Which of the following describes a Hamiltonian cycle?

Question 26 of 50

Which of the following best describes the pigeonhole principle?

Question 27 of 50

Which of the following describes an Euler path?

Question 28 of 50

Which of the following describes an equivalence class?

Question 29 of 50

What does it mean for a set to be countable?

Question 30 of 50

Which of the following best describes a binary relation from set A to set B?

Question 31 of 50

Which of the following is true for a function to be bijective?

Question 32 of 50

What is the result of applying De Morgan’s law to the expression ¬(p∧q)\neg(p \land q)¬(p∧q) ?

Question 33 of 50

Which of the following describes the associative property of Boolean algebra?

Question 34 of 50

What does the absorption law in Boolean algebra state?

Question 35 of 50

Which of the following describes a simple graph?

Question 36 of 50

What does the principle of strong mathematical induction involve?

Question 37 of 50

Which of the following is true for a minimal element in a partially ordered set?

Question 38 of 50

Which of the following best describes a matrix product?

Question 39 of 50

Which of the following best describes a diagonal matrix?

Question 40 of 50

What is the identity matrix?

Question 41 of 50

Which of the following is true for a square matrix to be invertible?

Question 42 of 50

Which of the following best describes a singular matrix?

Question 43 of 50

What is Gaussian elimination used for?

Question 44 of 50

What is the pigeonhole principle used for in combinatorics?

Question 45 of 50

Which of the following best describes a path in graph theory?

Question 46 of 50

Which of the following describes a non-connected graph?

Question 47 of 50

What is the primary use of a depth-first search (DFS) algorithm in graph theory?

Question 48 of 50

Which of the following is true for a breadth-first search (BFS) algorithm?

Question 49 of 50

In the context of graph theory, what is a clique?

Question 50 of 50

Which of the following statements about trees is true?

Set 5 complete

You scored 0%

0 correct out of 0 answered (50 questions in this set).

Struggling with WGU D420?

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.

Chat Now