Cmpe 30094: Logic Circuits and Design

You might also like

Download as pdf or txt
Download as pdf or txt
You are on page 1of 4

Name: Cada, Jervin

Richmond Job M.
L. Lacar Date: 1/15/21
Student number: 2018-05711-MN-0
2018-04206-MN-0 Section: BSCPE 3-3

CMPE 30094: LOGIC CIRCUITS AND DESIGN


Boolean Algebra, Logic Gates and Truth Table

1. Y = ABC + AB’ (A’C’)’

2. X = A’B + (B + C)’

3. Y = A + B + C’

4. Z = A + BCD

5. X = (BC)’ + (AB+C’)’
B. Derive the Boolean Expression and truth tables of the following logic circuits.
1.

Y = AB A’

2.

Y = A’B C
3.
Y= ̅̅̅̅̅̅̅̅̅̅̅
𝐴𝐵 + 𝐶 ’ + ̅̅̅̅̅̅̅̅
𝐵 ∗ 𝐶

C. Answer the following questions using this logic circuit.

1. 1
2. 0
3. 1
4. 0
5. 1
6. 1
7. 1
8. 1
9. y = AB + (A+B)
10. y = A’B’ + (A’+B’)

D. Answer the following questions

1. What are basic properties of Boolean algebra?

- commutative, associative, and distributive.

2. State the associative property of Boolean algebra.


- This property tells us we can associate groups of added or multiplied variables together with
parentheses without altering the truth of the equations.

3. State the commutative property of Boolean algebra.


- The commutative property tells us we can reverse the order of variables that are either
added together or multiplied together without changing the truth of the expression.

4. State the distributive property of Boolean algebra.

- Distributive Law states that the multiplication of two variables and adding the result with a
variable will result in the same value as multiplication of addition of the variable with individual
variables.

5. State the absorption law of Boolean algebra.

- The absorption law states that x OR (x AND y) is x and x AND (x OR y) is x. The theorems
of boolean algebra can be proved using Huntington postulates.

You might also like