Report On Basic Logic Gates, Boolean Algebra and Laws
Name (D2D student): Panara Mahammad Ayas
❖ Basic logic gates
1. AND gate
Symbol:
Function: outputs 1 only when all inputs are 1.
Boolean expression: Y = A • B
Truth Table:
A
B
Y=A•B
0
0
0
0
1
0
1
0
0
1
1
1
2. OR gate
Symbol:
Function: outputs 1 if at least one input is 1.
Boolean expression: Y = A + B
Truth Table:
A
B
Y=A+B
0
0
0
0
1
1
1
0
1
1
1
1
3. NOT gate
Symbol:
Function: inverts the input.
Boolean expression: Y = Ā
Truth table:
A
Y=Ā
0
1
1
0
• Simulation work
AND gate
AND gate work as expected gives high output only on all high input, Output is 1
only when all input is 1.
OR gate
Or gate correctly output high if at least one input is high, output 1 when only one
or both input are 1.
NOT gate
NOT gate perform logical inversion accurately, output is inverted from input.
❖ Boolean Algebra Basics
Boolean algebra is a mathematical used to work with binary variables. It is
essential for simplifying logical expression and designing efficient circuits.
•
Binary Variables: only two variable 0(false) and 1(true)
• Basic Binary Operation:
1. AND (•): output is 1 only when all inputs are 1.
2. OR (+): output is 1 when at least one input is 1.
3. NOT (¯): invert the value.
❖ Boolean Algebra Laws
1. Identity Law:
A+0=A
A•1=A
2. Null law:
A+1=1
A•0=0
3. Idempotent Law:
A+A=A
A•A=A
4. Inverse law:
A+Ā=1
A•Ā=0
5. Commutative law:
A+B=B+A
A•B=B•A
6. distributive law:
A • (B + C) = (A • B) + (A • C)
A + (B • C) = (A + B) • (A + C)
7. Associative law
A + (B + C) = (A + B) + C
A • (B • C) = (A • B) • C
8. De- morgan's theorems
(A + B)’ = A’ • B’
(A • B)’ = A’ + B’
❖ Conclusion
Understanding Basic Logic Gate and Boolean Algebra is essential in digital
electronics. these concepts form the basic building block of digital system
including microprocessor, memory and digital control system. Boolean laws
help to solve complex logical expression and optimize digital circuit design.