Chapter 4: Boolean Algebra Flashcards
Set of rules for working with variables whose values are either 0 or 1.
Boolean Algebra
An indication of the vital role that logic plays in this field.
Digital Logic
a Boolean variable or the complement of a Boolean variable.
Literal
Example: x, y, z are literals
A product of literals.
Minterm
Example: xyz is a minterm
A Boolean expression that is a sum of products of literals is said to be
Disjunctive Normal Form (DNF)
A Boolean expression that is a product of sums of literals is said to be
Conjunctive Normal Form (CNF)
Each term that is a sum of literals is called a
Clause
Boolean expression as input and asks whether it is possible to set the values of the variables so that the expression = 1
Boolean satisfiability (SAT)
These are built from electrical devices called gates.
Circuits
Receives some number of Boolean input value and produces an output based on the values of input is called a
Gate
Three types of gates are
AND: multiplication
OR: addition
Inverter: complement
The output of the circuit depends only on the present combination of inout values and not on the state of a circuit is called
Combinational Circuit