Learning objectives
■ Use logic gate symbols for NOT, AND, OR, NAND, NOR
and XOR
■ Understand and define the functions of the NOT, AND,
OR, NAND, NOR and XOR (EOR) gates
■ Construct the truth table for each of the above logic
gates
■ Construct a logic circuit from:
• a problem statement
• a logic expression
• a truth table
Learning objectives
■ Construct a truth table from:
• a problem statement
• a logic circuit
• a logic expression
■ Construct a logic expression from:
• a problem statement
• a logic circuit
• a truth table.
Chapter 4: Logic Gates and Logic
Circuits
4.01 Boolean logic and problem statements
Consider the following question:
Is Colombo further north than Singapore?
This could be rephrased to make use of the language of Boolean logic:
Colombo is further north than Singapore: TRUE or FALSE?
More formally, the statement:
Colombo is further north than Singapore.
Chapter 4: Logic Gates and Logic
Circuits
Chapter 4: Logic Gates and Logic
Circuits
4.02 Boolean Operators
Chapter 4: Logic Gates and Logic
Circuits
Chapter 4: Logic Gates and Logic
Circuits
Chapter 4: Logic Gates and Logic
Circuits
Chapter 4: Logic Gates and Logic
Circuits
ANSWER to the Worked Example 4.01:
The logic expression can now be written in an equation using X to
represent ‘a delivery is ordered’:
X = A OR B OR (C AND D)
Chapter 4: Logic Gates and Logic
Circuits
Chapter 4: Logic Gates and Logic
Circuits
4.03 Truth Tables
The truth table is a simple but powerful technique for representing any
logic expression or for describing the possible outputs from a logic
circuit.
A truth table is presented by making use of the convention that TRUE
can be represented as 1 and FALSE can be represented as 0. The
simplest use of a truth table is to represent the logic associated with a
Boolean operator.
Chapter 4: Logic Gates and Logic
Circuits
Chapter 4: Logic Gates and Logic
Circuits
Chapter 4: Logic Gates and Logic
Circuits
4.04 Logic circuits and logic gates
The digital circuits that constitute the inner workings of a computer
system operate as logic circuits where each individual part of the circuit
is either in an ‘on’ state, corresponding to a 1, or in an off state,
corresponding to a 0. A logic circuit comprises component parts called
logic gates. Each different logic gate has an operation that matches a
Boolean operator.
Chapter 4: Logic Gates and Logic
Circuits
Chapter 4: Logic Gates and Logic
Circuits
Figure 4.02 Logic gate symbols and
their associated truth tables
Chapter 4: Logic Gates and Logic
Circuits
Figure 4.02 Logic gate symbols and
their associated truth tables
Chapter 4: Logic Gates and Logic
Circuits
Chapter 4: Logic Gates and Logic
Circuits
Question 4.01
Can you recall from memory the symbols and definitions of the six
logic gates introduced in this chapter?
Chapter 4: Logic Gates and Logic
Circuits
Chapter 4: Logic Gates and Logic
Circuits
Chapter 4: Logic Gates and Logic
Circuits
Chapter 4: Logic Gates and Logic
Circuits
Chapter 4: Logic Gates and Logic
Circuits
Chapter 4: Logic Gates and Logic
Circuits
Chapter 4: Logic Gates and Logic
Circuits
Chapter 4: Logic Gates and Logic
Circuits
Chapter 4: Logic Gates and Logic
Circuits
Chapter 4: Logic Gates and Logic
Circuits
Chapter 4: Logic Gates and Logic
Circuits
Chapter 4: Logic Gates and Logic
Circuits
Chapter 4: Logic Gates and Logic
Circuits
Reflection Point:
Looking back over the chapter content, what would you say is the
central concept in the subject matter?
Summary
■ A logic expression comprises logic propositions and Boolean
operators.
■ Logic circuits are constructed from logic gates.
■ The operation of a logic gate matches that of a Boolean
operator.
■ The outcome of a logic expression or a logic circuit can be
expressed as a truth table.
■ A logic expression can be created from a truth table using
the rows that provide a 1 output.