Colegio de Kidapawan

BSIT Program
Quezon Boulevard, Kidapawan City

Subject : Discrete Mathematics

Instructor : Engr. Jerson P. Tingson
Room : B-33
Day : TTH
Time : 1:00am-2:30pm
Name : Reyes, Kenneth, A.
Section : BSIT-1B
Activity# : 3
Lesson# : 2 and 3
Chapter Title: Boolean Algebra

1. Double complement law of a set S. The complement of the set S′, where S′ itself is just the
complement of S; the double complement of S is thus S itself. In logic double complement implies
double negation of an element x, say, i.e. x itself.
2. Complement Law – A term AND´ed with its complement equals “0” and a term OR´ed with its
complement equals “1”
3. Idempotent Law – An input that is AND´ed or OR´ed with itself is equal to that input.
4. Identity Law – A term OR´ed with a “0” or AND´ed with a “1” will always equal that term.
5. Commutative Law – The order of application of two separate terms is not important
6. Associative Law – This law allows the removal of brackets from an expression and regrouping of
the variables.
7. Simplification law - In this approach, one Boolean expression is minimized into an equivalent
expression by applying Boolean identities.
8. Distributive Law – This law permits the multiplying or factoring out of an expression.
9. This law works depending of the concept of Duality. Duality means interchanging the operators
and variables in a function, such as replacing 0 with 1 and 1 with 0,AND operator with OR
operator and OR operator with AND operator.

Quizzes:
A. Create a truth and Find the value of the following problem based on the
correct truth table.
1. F(x, y, z) = x’ y’ z’ + x y’ z + x y z’ + x y z
2. F(x, y, z) = x’ y z’ + x y’ z + x y z’ + x’ y z’ + x’ y’ z’
3. F(x, y, z) = x’ y’ z + x y’ z + x y’ z’ + x y z’ + x’ y z
B. Minimize the following Boolean expression using Boolean identities:
1. F (A, B, C) = A’B + AB’C’ + ABC’
2. F (X, Y , Z) = X’ Y Z’+ XY’Z’+ XY’Z
C. Minimize the following Boolean expression using K-map:
1. F(A, B, C) = A’BC+ ABC+ AB’C+ A’B’C (Note: create your own truth table based on the
given Boolean expression )
2. F (A, B, C) = A’B’C’ + AB’C’ + AB’C + ABC + A’BC + A’BC’