Boolean Algebra - Binary logic

Due 12 Feb. 2010 at start of class, in class

90 points

In the following table ! preceeding an input specifies NOT

Laws
Identity
Null
Itempotent
Inverse
Commutative
Associative
Distributive
Absorption
De Morgan's
Cancelation
  AND
1*A=A
0*A=0
A*A=A
A*!A=0
A*B=B*A
(A*B)*C=A*(B*C)
A+B*C=(A+B)*(A+C)
A*(A+B)=A
!(A*B)=!A+!B
!!A=A
  OR
0+A=A
1+A=1
A+A=A
A+!A=1
A+B=B+A
(A+B)+C=A+(B+C)
A*(B+C)=A*B+A*C
A+A*B=A
!A*!B=!(A+B)

General rule: When given a combination of ANDs, ORs and NOTs, NOTS applied to particular input are applied first, then ANDS, then ORs. Statements inside parens resolved before those outside.

All problems are to be done by hand with pencil. Typed assignments not accepted.


Simplification

For each of the following problems, simplify the statements using boolean algebra.

Example:

Problem: F=S*T+V*W+R*S*T

F=S*T+R*S*T+V*W- Commutative law
F=1*S*T+R*S*T+V*W - Identity law
F=(1+R)*S*T+V*W - Distributave(or)
F=1*S*T+V*W - Null
F=S*T+V*W - Identity law

Part A. (5 points ea.) Fill in the truth tables for each problem.
Table page

Part B. (5 points ea.) Simplify the equation. Show your work and name the rules as they are applied. You may use any rule except absorption and you don't have to state the commutative and associative rules when applied. The solution for each problem is stated on the right of the =

1. A*(B+A*B)=A*B 2. !((!A+B)*(A+!B))=A*!B+!A*B 3. !(A*!B+!A*B)=A*B+!(A+B)
4. !A*(B+A*B)=!A*B 5. !(A*!(B+A*B))=!A+B 6. !(!A*!(B+A*B))=A+B
7. A*B+B*C*(B+C)=(A+C)*B 8. A*!B*C+!(B+C)=(A+!C)*!B 9. A*(B+C)+!ABC=A*B+A*C+B*C