Digital Electronics

Logic Gates

Sogeri NSOE
Science Department
Grade 12 physics – 2024

Mr. Semion Omba

Lesson Objectives
Students can be able to:

1. Identify and explain the seven types of logic gates (AND, OR, NOT,
NAND, NOR, XOR, XNOR) and their respective symbols in circuit
diagrams.
2. Analyze and compare the characteristics of each logic gate including
their truth tables, basic operations, and applications in electronic
circuits.
Digital Signal Levels
 DIGITAL LOGIC GATE
 A Digital Logic Gate is an electronic circuit which makes logical
decisions based on the combination of digital signals present on its
inputs.
 Digital logic gates can have more than one inputs, but generally
only have one digital output.
 Logic gates are the basic building blocks from which
most of the digital systems are built up.
 Individual logic gates can be connected or cascaded together
to form a logic gate function with any desired number of inputs,
or to form combinational and sequential type circuits, or to
produce different logic gate functions from standard gates.
 We will consider the basic logic gates, OR, AND, NOT, universal gates
NOR, NAND, exclusive gates XOR and XNOR gates along with their truth
tables, circuit diagrams, and their respective symbols.
 POSITIVE and NEGATIVE LOGICS
In computing systems, the number symbols 0 and 1 represent
two possible states of a circuit or device. It makes no difference
if these two states are referred to as ON and OFF, CLOSED and
OPEN, HIGH and LOW, PLUS and MINUS or TRUE and FALSE
depending on the circumstances. Main point is that they must
be symbolized by two opposite conditions.
In positive logic, a 1 represents
1. an ON circuit 2. a CLOSED switch 3. a HIGH voltage
4. a PLUS sign 5. a TRUE statement

Consequently, a 0 represents
1. an OFF circuit 2. an OPEN switch 3. a LOW voltage 4. a MINUS sign 5. a
FALSE statement. In negative logic, just opposite conditions prevail.
NOT Gate
 The Logic NOT Gate is the most basic of all the logical gates and is often
referred to as an Inverting Buffer or simply an Inverter.
 Inverting NOT gates are single input devicse which have an output level
that is normally at logic level “1” and goes “LOW” to a logic level “0”
when its single input is at logic level “1”, in other words it “inverts”
(complements) its input signal.

Zero

“If A is NOT true, then Q is true”

NOT GATE
AND Gate
 The Logic AND Gate is a type of digital logic circuit whose
output goes HIGH to a logic level 1 only when all of its inputs
are HIGH

“If both A and B are true, then Q is true”

AND Gate

Circuit diagram

Transistor logic gate

Diode logic gate

OR Gate
 The Logic OR Gate is a type of digital logic circuit whose output
goes HIGH to a logic level 1 only when one or more of its inputs
are HIGH

“If either A or B is true, then Q is true”

OR Gate
Circuit diagram
Transistor logic gate

Diode logic gate

Practice Exercises
Write the truth table and their Boolean
expression for each of the following.
a) i)

b) i)

ii)
ii)

iii)

Q
Homework
Please, read the notes on Universal and
Exclusive gates. (ref: H/O)
Logic Gates
(Universal & Exclusive Gates)

Sogeri NSOE
Science Department
Grade 12 physics – 2024

Mr. Semion Omba

 Lesson Objectives
At the end of this lesson students can be able to:

1. Identify and explain the seven types of logic gates (NAND, NOR, XOR,
XNOR) and their respective symbols in circuit diagrams.
2. Analyze and compare the characteristics of each logic gate including
their truth tables, basic operations, and applications in electronic
circuits.
 Universal gates
A universal gate is a gate which can implement any Boolean function
without need to use any other gate type. The NAND and NOR gates
are universal gates. In practice, this is advantageous since NAND and
NOR gates are economical and easier to fabricate and are the basic
gates used in all IC digital logic families.
 NAND Gate
 The Logic NAND Gate is a combination of a digital logic AND gate
and a NOT gate connectedtogether in series
 The NAND (Not – AND) gate has an output that is normally at logic level
“1” and only goes “LOW” to logic level “0” when ALL of its inputs are at
logic level “1”. The Logic NAND Gate is the reverse or “Complementary”
form of the AND gate we have seen previously.

“If both A and B are true, then Q is NOT true”

NAND GATE
NAND gate using diode

NAND Circuit
diagram
NOR Gate
 The Logic NOR Gate gate is a combination of the digital logic OR
gate and an inverter or NOT gate connected together in series
 Universal Gate
 NOR GATE
Diode NOR gate
Transistor NOR gate

Circuit diagram
 XOR
 Exclusive-OR gate ONLY goes “HIGH” when both of its two
input terminals are at “DIFFERENT” logic levels with respect
to each other. If these two inputs, A and B are both at logic
level “1” or both at logic level “0” the output is a “0”

Q = (A ⊕ B) = A.B’ + A’.B
XOR GATE
XNOR Gate
 The Exclusive-NOR Gate function is a digital logic gate that is
the reverse or complementary form of the Exclusive-OR
function
Q= A’B’ + AB
Example
Write the truth table.
EXERCISES
Refer to handout!! ☺

1. Exercise 5 on page 29. Copy and

complete question 1 to 4.
2. Exercise 6, on page 36. Do questions
1 to 6.
Combinations of
Basic Logic Gates

Sogeri NSOE
Science Department
Grade 12 physics – 2024

Mr. Semion Omba

Lesson Objectives
Students can be able to:

A student will be able to design and implement a logic circuit

using a combination of basic logic gates to achieve a specific
output based on a given truth table or Boolean expression.
 COMBINATIONS OF LOGIC GATES
Combinational circuit
The input values explicitly determine the output
Sequential circuit
The output is a function of the input values and the
existing state of the circuit
We describe the circuit operations using
Boolean expressions
Logic diagrams
Truth tables
Gates are combined into circuits by using the output of
one gate as the input for another
Three inputs require eight rows to describe all possible input
combinations
This same circuit using a Boolean expression is (AB + AC)
Consider the following Boolean expression A(B + C)
Circuit equivalence
Two circuits that produce the same output for identical
input
Boolean algebra allows us to apply provable
mathematical principles to help design circuits
A(B + C) = AB + BC (distributive law) so circuits must be
equivalent
Properties of Boolean Algebra
Converting a Boolean expression to a logic diagram.

Steps involved in converting Boolean expression to

logic gates refer to page 38 on your handout.

Work on the exercise 7, questions 1 to 4.

Truth Table to Boolean
Expression
Sum-Of-Products, or SOP, Boolean expressions may be generated
from truth tables quite easily, by determining which rows of the
table have an output of 1, writing one product term for each row,
and finally summing all the product terms. This creates a Boolean
expression representing the truth table as a whole.

For example on two inputs

and exercise, Refer to
handout on page 39. Do
exercise 8.
How to write truth table for a combination of logic gates

Before we start construct truth table, we must derive

the Boolean expression. STEP: Convert from a logic
circuit diagram to a Boolean expression we start by
listing our inputs at the correct place and process the
inputs through the gates, one gate at a time, writing the
result at each gate's output.
Example 14.4 is on 2 inputs can be found in page 40.

Complete Exercise 9 on page 42.

Questions 1 to 6.