Fichas
Boolean
Fichas del conjunto (22)
- 1Properties of 00+X=X
0.X=0 - 2Properties of 11+X=1
1.X=X - 3Indempotence lawX+X=X
X.X=X - 4Involution(X')'=X
- 5Complementarity lawX+X'=1
X.X'=0 - 6Commutative LawX+Y=Y+X
X.Y=Y.X - 7Associative LawX+(Y+Z)=(X+Y)+Z
X(YZ)=(XY)Z - 8Distributive LawX(Y+Z)=XY+XZ
X+YZ=(X+Y)(X+Z)
X+X'Y=X+Y - 9Absorption LawX+XY=X
X(X+Y)=X - 10DeMorgan's Law(X+Y)'=X'Y'
(XY)'=X'+Y'
Note: Break the line, change the sign - 11Binary DecisionThe decision which results into either TRUE or FALSE is a binary decision
- 12Truth ValuesValues TRUE and FALSE are called truth values
- 13Truth table with n variables2^n rows
- 14GateA gate is a basic electronic circuit which operates on one or more signals to produce an output signal.
- 15Dual of an equation-Change signs
-invert individual variables - 16Canonical ExpressionA boolean expression composed entirely of minterms or maxterms
- 17Canonical SOPrepresented by sum of minterms
- 18Canonical POSproduct of maxterms
- 19XOR gateExclusive OR gate
odd no of 1 produce 1 - 20XNOR gateExclusive NOR gate
1 for even no of 1
- 21NAND to NAND logicsop form using basic gates; replace each gate with NAND gate
- 22NOR to NOR logicPOS form using basic gates; replace each gate with NOR gate
Información
- Descripción
- ACT Year 12 Certificate Computer Science Fichas sobre Boolean, creado por Banoshree Bose el 22/03/2016.
- Creado por
- Banoshree Bose
- Visitas
- 3
- Valoración