LOGIC GATES
🔹 Definition 1 1 1
A logic gate is an electronic device that performs a basic
logical operation on one or more input signals to produce a
single output. 🔸 3. OR Gate
They are the building blocks of digital circuits used in Has two or more inputs
computers, calculators, and control systems. Output is 1 if any input is 1
Logic gates work with binary values:
1 (TRUE) Boolean Expression: X =A ⋁ Bor X =A + B
0 (FALSE) Truth Table:
X=A⋁
Logic gates can be represented using: A B
Boolean expression: Boolean expression is a way of
B
writing a rule or decision using true or false statements.
0 0 0
Truth tables
0 1 1
Logic symbols
1 0 1
TYPES OF LOGIC GATES 1 1 1
🔸 1. NOT Gate (Inverter)
Has one input and one output 🔸 4. XOR Gate (Exclusive OR)
Inverts the input signal Output is 1 only when inputs are different
If input is 1, output is 0, and vice versa If both inputs are the same, output is 0
Symbol: Boolean Expression: X =A ⊕ B
Truth Table:
A B X=A⊕B
Boolean Expression: X = Á or X =A '
0 0 0
Truth Table:
0 1 1
Input (A) Output (X)
1 0 1
0 1
1 1 0
1 0
🔸 5. NAND Gate
🔸 2. AND Gate
Opposite of AND gate
Has two or more inputs and one output
Output is 1 except when all inputs are 1
Output is 1 only if all inputs are 1
Boolean Expression: X =¿
Truth Table:
X = (A ⋀
Boolean Expression: X =A ⋀ Bor X =A ⋅B
A B
Truth Table:
X=A⋀
B)'
A B
0 0 1
B
0 1 1
0 0 0
1 0 1
0 1 0
1 1 0
1 0 0
This law states that a variable would remain unchanged when
🔸 6. NOR Gate it is ANDed with ‘1’ or ORed with ‘0’.
Opposite of OR gate A⋀ 1=A
Output is 1 only when all inputs are 0 A⋁ 0=A
Boolean Expression: X =¿ ✅ De Morgan’s Law
Truth Table: First Law: If you say "NOT (A OR B)”, it means that both A
A B X = (A ⋁ and B are false. Rewritten as "NOT A AND NOT B”.
B)' 1. ~ (A ⋁ B) = ~ A ⋀ ~ B
0 0 1 Second Law: If you say "NOT (A AND B),"it means at least
one of them is false. This can be rewritten as "NOT A OR
NOT B." thus, expressed as ~ (A ⋀ B) = ~ A ⋁ ~ B
0 1 0
1 0 0
1 1 0
🔸 Disjunctive Normal Form (DNF)
Expression written as ORs of ANDs.
(A ⋀ B) ⋁ (~A ⋀ B) ⋁ (A ⋀ ~B)
COMBINATIONAL CIRCUITS
A combinational circuit connects two or more logic gates.
Meaning:
The output of one gate becomes the input of another.
If any of the conditions is TRUE, the output is TRUE.
🔸 Conjunctive Normal Form (CNF)
Expression written as ANDs of ORs.
(A ⋁ B) ⋀ (~A ⋁ B) ⋀ (A ⋁ ~B)
Because there are three inputs to this circuit, eight rows are
Meaning:
required to describe all possible input combinations. This
All conditions must be TRUE for the output to be TRUE.
same circuit using Boolean algebra: (AB + AC)
Arithmetic Operations
Arithmetic operations are the basic mathematical processes
used in computing and problem solving.
They include Addition, Subtraction, Multiplication, and
Division. These operations are the foundation of all
calculations in computer arithmetic, programming, and
BOOLEAN ALGEBRA data processing.
Boolean Algebra helps describe and simplify the behavior of Addition (+)
logic circuits using algebraic rules. Addition means combining two or more numbers to get their
🔹 Basic Operations total.
Operatio Symbol Meaning Example Example:
n If you have 5 cedis and your friend gives you 10 cedis,
AND ⋀ Both must be TRUE A⋀ B you will have 5 + 10 = 15 cedis.
OR ⋁ At least one is TRUE A⋁ B Properties of Addition
NOT ~ Inverts value ~A or A' 1. Commutative Property:
The order of numbers doesn’t change the sum.
✅ Identity Law
→a+b=b+a →a×1=a
Example: 3 + 7 = 7 + 3 Example: 9 × 1 = 9
2. Associative Property: 4. Distributive Property:
The way numbers are grouped doesn’t change the Multiplication distributes over addition.
total. → a × (b + c) = (a × b) + (a × c)
→ (a + b) + c = a + (b + c) Example: 2 × (4 + 3) = (2 × 4) + (2 × 3) = 14
Example: (2 + 3) + 4 = 2 + (3 + 4)
3. Identity Property: Division (÷ or /)
Adding zero to any number gives the same number. Division means splitting or sharing a number into equal
→a+0=a parts.
Example: 15 + 0 = 15 Example:
If you have 20 oranges and share them equally among 4
Subtraction (−) friends, each person gets 20 ÷ 4 = 5 oranges.
Subtraction means taking away one number from another or Properties of Division
finding the difference. 1. Not Commutative:
Example: Changing the order changes the result. → a ÷ b ≠ b ÷ a
If you have 10 mangoes and give 3 to your sister, Example: 10 ÷ 5 ≠ 5 ÷ 10
you’ll have 10 − 3 = 7 mangoes left. 2. Not Associative:
Properties of Subtraction Grouping changes the result. → (a ÷ b) ÷ c ≠ a ÷ (b ÷ c)
1. Not Commutative: Example: (20 ÷ 2) ÷ 5 ≠ 20 ÷ (2 ÷ 5)
Changing the order gives different answers. Order of Operations (PEMDAS)
a − b ≠ b – a Example: 8 − 3 ≠ 3 – 8 When solving expressions with more than one operation,
2. Not Associative: follow the PEMDAS rule:
Changing the grouping gives different results. 1. P – Parentheses
(a − b) − c ≠ a − (b − c) Example: (10 − 4) − 2 ≠ 10 − (4 − 2) 2. E – Exponents
3. M/D – Multiplication and Division (left to right)
Multiplication (× or ) 4. A/S – Addition and Subtraction (left to right)
Multiplication means repeated addition of the same number. Example:
Example: Solve: 4 + 2 × (9 + 3) ÷ 3² − 5
If you buy 3 boxes of pens and each box has 4 pens, → (9 + 3) = 12
then you have 3 × 4 = 12 pens. → 4 + 2 × 12 ÷ 9 − 5
Properties of Multiplication → 4 + 24 ÷ 9 − 5
1. Commutative Property: → 4 + 2.67 − 5
Changing the order doesn’t change the product. → a × b = b × a → 1.67
Example: 5 × 7 = 7 × 5
2. Associative Property:
Changing the grouping doesn’t change the result.
→ (a × b) × c = a × (b × c)
Example: (2 × 3) × 4 = 2 × (3 × 4)
3. Identity Property:
Multiplying by 1 gives the same number.