Exam 12: A: Boolean Algebra
Exam 1: The Foundations: Logic and Proofs18 Questions
Exam 1: A: the Foundations: Logic and Proofs201 Questions
Exam 2: Basic Structures: Sets, Functions, Sequences, Sums, Matrices5 Questions
Exam 2: A: Basic Structures: Sets, Functions, Sequences, Sums, Matrices210 Questions
Exam 3: Algorithms8 Questions
Exam 3: A: Algorithms54 Questions
Exam 4: Number Theory and Cryptography10 Questions
Exam 4: A: Number Theory and Cryptography149 Questions
Exam 5: Induction and Recursion10 Questions
Exam 5: A: Induction and Recursion51 Questions
Exam 6: Counting14 Questions
Exam 6: A: Counting155 Questions
Exam 7: Discrete Probability9 Questions
Exam 7: A: Discrete Probability50 Questions
Exam 8: Advanced Counting Techniques16 Questions
Exam 8: A: Advanced Counting Techniques124 Questions
Exam 9: Relations13 Questions
Exam 9: A: Relations72 Questions
Exam 10: Graphs14 Questions
Exam 10: A: Graphs131 Questions
Exam 11: Trees13 Questions
Exam 11: A: Trees94 Questions
Exam 12: Boolean Algebra11 Questions
Exam 12: A: Boolean Algebra67 Questions
Exam 13: Modeling Computation14 Questions
Exam 13: A: Modeling Computation67 Questions
Exam 14: Mathematics Problem Set: Set Theory, Number Theory, Combinatorics, and Boolean Algebra29 Questions
Select questions type
determine whether the statement is TRUE or FALSE. Assume that x, y, and z represent Boolean variables.
-
(True/False)
4.8/5
(37)
determine whether the statement is TRUE or FALSE. Assume that x, y, and z represent Boolean variables.
-
(True/False)
4.8/5
(46)
determine whether the statement is TRUE or FALSE. Assume that x, y, and z represent Boolean variables.
-
(True/False)
4.9/5
(38)
mark each statement TRUE or FALSE.
-When written as a sum of minterms in the variables x and
(True/False)
4.9/5
(37)
Using only the five properties associative laws, commutative laws, distributive laws, identity laws, and com- plement laws, prove that is true in all Boolean algebras.
(Essay)
4.9/5
(42)
mark each statement TRUE or FALSE.
-{+, ·} is a functionally complete set of operators.
(True/False)
5.0/5
(29)
fill in the blanks.
-There are ____ Boolean functions with 3 variables.
(Short Answer)
4.8/5
(33)
fill in the blanks.
-When written as a product of maxterms (in the variables x and y), ____.
(Short Answer)
5.0/5
(28)
Show that the Boolean function only the definition of a Boolean algebra.
(Essay)
4.9/5
(31)
Give a reason for each step in the proof that x + 1 = x is true in Boolean algebras. Your reasons should come from the following: associative laws for addition and multiplication, commutative laws for addition and multiplication, distributive law for multiplication over addition and distributive law for addition over multiplication, identity laws, unit property, and zero property.
(Essay)
4.9/5
(31)
Give a reason for each step in the proof that x + xy = x is true in Boolean algebras. Your reasons should come from the following: associative laws for addition and multiplication, commutative laws for addition and multiplication, distributive law for multiplication over addition and distributive law for addition over multiplication, identity laws, unit property, zero property, and idempotent laws. x+xy=x\cdot1+xy=x(y+)+xy=(xy+x)+xy=xy+(xy+x)=(xy+xy)+x=xy+x= x(y+)=x\cdot1=x
(Essay)
4.9/5
(22)
Showing 41 - 60 of 67
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)