Nick Marshall – WGU Note Repository

1)p(true) and not r(false) – true and false make false 2) not p or r – false or true making true? 3) not (p and r) – not ( true and true) = false 4) not p or q – false or false = false 2) true or false = true 3)false or false =…

7.4 Lesson: Graph theory and common graphs After completing this lesson you should be able to determine a graph’s properties (e.g., simple or multigraph, directed or undirected, cyclic or acyclic) and the vertex degree. Introduction to graph theory Undirected graphs in applications Molecular graphs: the vertices of the graph are the atoms in a molecule. There…

6.4 Lesson: Binary relations: Sets After completing this lesson you should be able to find which elements of two given sets are related by a binary operation. Binary relations on a set A binary relation on a set A is a subset of A x A. The set A is called the domain of the binary relation. An element that is…

4.11 Lesson: Linear equations using an inverse matrix After completing this lesson you should be able to solve a system of linear equations using an inverse matrix. Solving matrix equations using inverse matrices Solve the system of equations by finding a vector x that satisfies the equation Ax=b. If the coefficient matrix has an inverse, use it to solve…

3.5 Lesson: Boolean functions After completing this lesson you should be able to solve for a Boolean expression that matches a given input/output table. One way to define a Boolean function is to provide an input/output table that shows the output value of the function for every possible combination of input values A literal is a Boolean variable or the…

3.1 Unit 3: Boolean Algebra and Boolean Functions (14 Total Sections in Ch 3) Boolean operations Boolean expressions and equivalents Boolean functions Disjunction and conjunctive normal forms Simplifying Boolean expressions Digital logic, circuits, and gates 3.2 Module 10: Boolean Algebra and Applications Introduction to Boolean algebra Boolean expression equivalents Boolean functions 3.3 Lesson: Introduction to Boolean algebra 10.21.1…

2.12 Lesson: Applying set identity laws De Morgan’s laws for sets: A ∪ B = A∩B and A ∩ B = A∪B To prove a set identity, work with one side of the equation and manipulate it by using the identity laws until it matches the other side of the equation. To prove a set identity, you can translate the set notation into…

Now that you have completed this lesson you should be able to determine the power set in a given set. Take a moment to think about what you’ve learned in this lesson: The power set of a set A is denoted P(A) The power set of any set A is the set of all subsets of A, including the empty set…

2.1 Unit 2: Sets and Functions The material in this unit comprises 10% of the high-stakes assessment and includes such concepts as: Sets, subsets, and power sets Set operations Cartesian product of sets Set partitions Overview of functions Function properties 2.2 Module 6: Working with Sets This page marks the beginning of Module 6. This module contains…

A counterexample for a universally quantified statement is an element in the domain for which the predicate is false. existential quantifier The symbol ∃ is an existential quantifier and the statement ∃x P(x) is called a existentially quantified statement.  Now that you have completed this lesson you should be able to evaluate the truth values for universally quantified or existentially quantified statements.…