• ¿Documento equivocado? Cámbialo gratis
  • Escrito por estudiantes que aprobaron
  • Inmediatamente disponible después del pago
  • Leer en línea o como PDF
Vender
¿Dónde estudias?
Tu idioma
Document preview thumbnail
Vista previa 3 fuera de 22 páginas
Examen

Wgu C959 Discrete Mathematics I Actual Exam Questions And Correct Verified Solutions Latest Update This Year Just Releasedpdf Questions And Answers Ra

Document preview thumbnail
Vista previa 3 fuera de 22 páginas

WGU C959 Discrete Mathematics I Question and Solution Set 2026 | Verified A-Grade Answers What is the notation for subset? - answer - ⊆ A collection of objects is known as a - answer - set What is the notation for integers? - answer - ℤ What is the notation for element? - answer - ∈ What is the notation for set-roster? - answer - { } Write the set-builder notation for, "Numbers whose square roots are an integer" - answer - { x | √x ∈ ℤ} Write the set-builder notation for "the set of all x's, such that x is greater than 0" - answer - { x | x 0} T/F: Order matters in ordered pairs? - answer - True In a Cartesian Product of two sets, every element of the CROSS PRODUCT is an - answer - ordered pair What is the Cartesian Product for: {a,b} x {0,1} - answer - A x B = { {a,1} , {a,0} , {b,1} , {b,0} } Ordered pairs are _____ of the Cartesian Product - answer - elements A ______ is a subset between two different sets - answer - relation Give the general equation for Relations - answer - (a,b) ∈ A x B (i.e. (a,b) is the ordered pair and A x B are two different sets) Describe in words what this formula means: (a,b) ∈ A x B - answer - Ordered pair (a,b) are in the two sets A x B True ∧ True = - answer - True True ∧ False = - answer - False False ∧ False = - answer - False True ∨ False = - answer - True True ∨ True = - answer - True False ∨ False = - answer - False A compound proposition is a tautology if the proposition is always _____ - answer - True A compound proposition is a contradiction if the proposition is always _____ - answer - False If p is False and q is True, solve this equation. p → q - answer - True If an equation is show as this "p → q" and the hypothesis is false, then the answer to the question is _____ - answer - True Give the truth table for ¬(p ↔ q) - answer - F T T F What is the logical equivalence of ¬(p ∧ q) ≡ ? - answer - (¬p ∨ ¬q) What is the logical equivalence of ¬(p ∨ q) ≡ ? - answer - (¬p ∧ ¬q) What is the logical equivalence of p→q ≡ ? - answer - (¬p ∨ q) In Boolean Algebra the addition symbol is the same as what? - answer - OR The XOR operation outputs 1 when what? - answer - Both inputs are different (1 XOR 0 = 1) (1 XOR 1 = 0) Boolean multiplication is the same as what? - answer - AND The minterm must evaluate to what - answer - 1 0 NAND 1 = - answer - 1 1 NAND 1 = - answer - 0 0 NAND 0 = - answer - 1 The NAND gate computes the NAND operation: - answer - x↑y The NOR gate computes the NOR operation: - answer - x↓y The NAND gate outputs 0 if all inputs are _____ - answer - 1 The NOR gate outputs 1 if all inputs are _____ - answer - 0 The gate outputs 1 if all inputs are 0 and outputs _____ - answer - 0 1 NOR 1 = - answer - 0 1 NOR 0 = - answer - 0 0 NOR 0 = - answer - 1 A two-input XOR gate (for "exclusive OR") outputs 1 if the input values differ. True or False - answer - True 1 XOR 0 = - answer - 1 1 XOR 1 = - answer - 0 0 XOR 0 = - answer - 0 A two-input XNOR gate (for "exclusive NOR") outputs 1 if the input values are the same. True or False - answer - True 1 XNOR 0 = - answer - 0 1 XNOR 1 = - answer - 1 0 XNOR 0 = - answer - 1 Which gate follows the same rules as Boolean multiplication? - answer - AND Which gate follows the same rules as Boolean addition? - answer - OR What is the maximum length of a cycle in a graph? - answer - The amount of Vertices that connect. The proposition p ⊕ q is true if... - answer - Exactly one of the propositions p and q is true but not both Give DeMorgans Law for QUANTIFIED STATEMENTS (there are 2 laws) - answer - ¬∀xP(x) ≡ ∃x¬P(x) ¬∃xP(x) ≡ ∀x¬P(x) Use DeMorgans Law to solve: ¬∃x P(x) - answer - ∀x ¬P(x) Use DeMorgans Law to solve: ¬∃x (P(x) ∨ Q(x)) - answer - ∀x (¬P(x) ∧ ¬Q(x)) Use DeMorgans Law to solve: ¬∀x (P(x) ∧ Q(x)) - answer - ∃x (¬P(x) ∨ ¬Q(x)) Is the variable y bound in th


Información del documento

Subido en
12 de octubre de 2026
Número de páginas
22
Escrito en
2026/2027
Tipo
Examen
Contiene
Preguntas y respuestas
$19.99

¿Documento equivocado? Cámbialo gratis Dentro de los 14 días posteriores a la compra y antes de descargarlo, puedes elegir otro documento. Puedes gastar el importe de nuevo.
Escrito por estudiantes que aprobaron
Inmediatamente disponible después del pago
Leer en línea o como PDF

Vendido
4
Seguidores
0
Artículos
2552
Última venta
5 días hace



Por qué los estudiantes eligen Stuvia

Creado por compañeros estudiantes, verificado por reseñas

Calidad en la que puedes confiar: escrito por estudiantes que aprobaron y evaluado por otros que han usado estos resúmenes.

¿No estás satisfecho? Elige otro documento

¡No te preocupes! Puedes elegir directamente otro documento que se ajuste mejor a lo que buscas.

Paga como quieras, empieza a estudiar al instante

Sin suscripción, sin compromisos. Paga como estés acostumbrado con tarjeta de crédito y descarga tu documento PDF inmediatamente.

Student with book image

“Comprado, descargado y aprobado. Así de fácil puede ser.”

Alisha Student

Preguntas frecuentes

Ups! No podemos cargar tu documento ahora. Inténtalo de nuevo o contacta con soporte.