1. Unit 10 Boolean Logic (STUDENT) (3)
1. Unit 10 Boolean Logic (STUDENT) (3)
Unit
Objectives
Silent Starter
1
Without looking back, how many logic gates can you correctly match up?
NOT
Gate
AND
Gate
NOR
Gate
OR Gate
NAND
Gate
XNOR
Gate
XOR
Silen Gate
t
Star
t
Silent Starter
2a
Without looking back, how many logic gates can you correctly match up
to the truth table?
A B OUTPU A B OUTPU
T T
0 0 1 0 0 0
0 1 0 0 1 1
1 0 0 1 0 1
1 1 0 1 1 1
A B OUTPU A B OUTPU
T T
0 0 0 0 0 0
0 1 1 0 1 0
1 0 1 1 0 0
Silen
t 1 1 0 1 1 1
Star
t
Silent Starter
2b
Without looking back, how many logic gates can you correctly match
up to the truth table?
A OUTPU
T
0 1 A B OUTPU
1 0 T
0 0 1
A B OUTPU
0 1 0
T
1 0 0
0 0 1
1 1 1
0 1 1
1 0 1
Silen 1 1 0
t
Star
t
Silent Starter 3
Why have we not learnt about exclusive AND / exclusive NAND?
What would the truth table for exclusive AND look like?
Silen
t
Star
t
Silent Starter 4
What is the logic statement for the diagram below?
Silen
t
Star
t
Keywords: Boolean Logic
Key Word Definition
Logic Gate The basic foundation of a digital circuit that controls
the flow of electronic signals.
EXOR (Exclusive OR) Where one (but NOT both) input should be positive to
achieve a positive output.
Keyw
o rds Truth Table The way of showing the outcome of a logic gate /
circuit.
Boolean
Logic
Logic gates take binary inputs and
produce a binary output – on or off.
Vide
o
Boolean Logic – AND Gate
Not A or A
Teac
her
Exp l
anat
i
on
Boolean Logic – XOR Gate
Teac
Exp l
her AB = A XOR B or AB = (a·b)+(a ·b)
anat
i
on
Boolean Logic – NOR Gate
AB = A + B Or AB = A NOR B
Teac
her
Exp l
anat
i
on
Boolean Logic – NAND
Gate
How do you make this a NOT AND (NAND)
gate?
1
1
1
0
The same as an AND gate, but the outputs are opposite, so 1 = 0 and 0 = 1.
Teac AB = A . B Or AB = A NAND B
her
Exp l
anat
i
on
Task: Logic Gates
Complete the table below, giving the symbol and the truth table,
without looking back.
Gate Symbol Truth Table
A Answer
0 1
NOT 1 0
A B Answer
0 0 0
AND 0 1 0
1 0 0
Task
1 1 1
Task: Logic Gates
Complete the table below, giving the symbol and the truth table, without
looking back.
Gate Symbol Truth Table
A B Answer
0 0
OR 0 1
1 0
1 1
A B Answer
0 0
XOR 0 1
1 0
Task
1 1
Task: Logic Gates
Complete the table below, giving the symbol and the truth table, without
looking back.
Gate Symbol Truth Table
A B Answer
0 0
NOR 0 1
1 0
1 1
A B Answer
0 0
NAND 0 1
1 0
Task
1 1
Task: Logic Gates
Complete the table below, giving the symbol and the truth table, without
looking back.
Gate Symbol Truth Table
A B Answer
0 0
0 1
XNOR
1 0
1 1
Task
Task: Logic Gates
Using the truth tables you completed above, describe in words what happens to
the output, the first one is done for you.
Work
Exam ed
ple
Worked Examples: Logic
1. List each of your inputs, preferably in alphabetical order.
Gates
R
Work
Exam ed
ple (P and Q) and
Worked Examples: Logic
Gates
2. Go through each of the predicate(s) one by one and add the correct
symbol. Our first predicate is (P and Q).
R (P and Q)
Work
Exam ed
ple (P and Q) and
Worked Examples: Logic
Gates
2b. The next predicate is NOT R.
R (P and Q)
Work
Exam ed
ple (P and Q) and
Worked Examples: Logic
Gates
2b. The next predicate is NOT R.
Q NOT R
R
Work
Exam ed
ple (P and Q) and
Worked Examples: Logic
Gates
3. You must then link each separate predicate, each predicate is separated
with (brackets). Between each predicate will be AND, OR, NOT etc, you must
find this and use this gate.
Q X
R
Work
Exam ed
ple (P and Q) and
Worked Examples: Logic
Gates
4. So we use AND to link our two predicates and X can be
our output.
Q X
R
Work
Exam ed
ple (P and Q) and
Task: Logic Gates
Task: Using the symbols below, draw the logic circuit for:-
(A or B) AND NOT C
A
X
B
C
Task
Worked Examples: Logic
Gates
Complete the truth table for
or
(P.Q).¬R
Work
Exam ed
ple
Worked Examples: Logic
Gates
(P and Q) and NOT R
P Q R (P .Q).¬
P.Q ¬R
1.Break each R
0 0 0 0 1 0
predicate down.
0 0 1 0 0 0
So start with P and 0 1 0 0 1 0
Q 0 1 1 0 0 0
1 0 0 0 1 0
1 0 1 0 0 0
1 1 0 1 1 1
Work 1 1 1 1 0 0
Exam ed
ple
Worked Examples: Logic
Gates
(P and Q) and NOT R
P Q R (P .Q).¬
P.Q ¬R
R
2. Now do NOT R 0 0 0 0 1 0
0 0 1 0 0 0
0 1 0 0 1 0
0 1 1 0 0 0
1 0 0 0 1 0
1 0 1 0 0 0
1 1 0 1 1 1
Work 1 1 1 1 0 0
Exam ed
ple
Worked Examples: Logic
Gates
(P and Q) and NOT R
P Q R (P .Q).¬
P.Q ¬R
R
Now we look at the 0 0 0 0 1 0
AND.
0 0 1 0 0 0
0 1 0 0 1 0
0 1 1 0 0 0
1 0 0 0 1 0
1 0 1 0 0 0
1 1 0 1 1 1
Work 1 1 1 1 0 0
Exam ed
ple
Task: Truth Table
Task: Complete the truth table for:-
(A or B) AND NOT C
Task
Task: Logic Circuit and Truth
Tmay
For the following logic circuit diagram state the logic the truth table. You able
add more columns to the truth tables to help.
Solve the logic statement and truth table for the circuit below:
A B C P
0 0
0 1
1 0
1 1
Logic
Statement:
Task
Task: Logic Circuit and Truth
Tmay
For the following logic circuit diagram state the logic the truth table. You able
add more columns to the truth tables to help.
Solve the logic statement and truth table for the circuit below:
A B C P
0 0
0 1
1 0
1 1
Logic
Statement:
Task
Task: Logic Circuit and Truth
Tmay
For the following logic circuit diagram state the logic the truth table. You able
add more columns to the truth tables to help.
Solve the logic statement and truth table for the circuit below:
A B C E F D
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
Logic
Statement: 1 0 1
1 1 0
Task 1 1 1
Task: Logic Circuit and Truth
Tmay
For the following logic circuit diagram state the logic the truth table. You able
add more columns to the truth tables to help.
Solve the logic statement and truth table for the circuit below:
A B C P Q X
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
Logic
Statement: 1 0 1
1 1 0
Task 1 1 1
Task: Logic Circuit and Truth
For the following logic statements create a logic circuit diagram using Table
https://logic.ly/demo create a logic circuit diagram and truth tables for the
following.
For the truth tables, add any columns you fell necessary.
Logic Statement: (A AND B) EXOR C = X
Logic Circuit Diagram A B C X
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
Task
1 1 1
Task: Logic Circuit and Truth
For the following logic statements create a logic circuit diagram using Table
https://logic.ly/demo create a logic circuit diagram and truth tables for the
following.
For the truth tables, add any columns you fell necessary.
Logic Statement: (A OR B) NAND C = X
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
Task 1 1 0
1 1 1
Task: Logic Circuit and Truth
Table
For the following logic circuit diagram state the logic the truth table. You may
add more columns to the truth tables to help.
Solve the logic statement and truth table for the circuit below:
Logic Statement:
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
Task 1 1 0
1 1 1
Task: Logic Circuit and Truth
Table
For the following logic circuit diagram state the logic the truth table. You may
add more columns to the truth tables to help.
Solve the logic statement and truth table for the circuit below:
Logic Statement:
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
Task 1 1 0
1 1 1
Task: Logic Circuit and Truth
Table
For the following logic circuit diagram state the logic the truth table. You may
add more columns to the truth tables to help.
Solve the logic statement and truth table for the circuit below:
Logic Statement:
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
Task 1 1 0
1 1 1
Task: Logic Circuit and Truth
Table
For the following logic circuit diagram state the logic the truth table. You may
add more columns to the truth tables to help.
Solve the logic statement and truth table for the circuit below:
Logic Statement:
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
Task 1 1 0
1 1 1
Task: Logic Circuit and Truth
Table
For the following logic circuit diagram state the logic the truth table. You may
add more columns to the truth tables to help.
Solve the logic statement and truth table for the circuit below:
Logic Statement:
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
Task 1 1 0
1 1 1
Task: Logic Circuit and Truth
Table
For the following logic circuit diagram state the logic the truth table. You may
add more columns to the truth tables to help.
Solve the logic statement and truth table for the circuit below:
Logic Statement:
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
Task 1 1 0
1 1 1
Task: Logic Circuit and Truth
Table
For the following logic circuit diagram state the logic the truth table. You may
add more columns to the truth tables to help.
Solve the logic statement and truth table for the circuit below:
Logic Statement:
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
Task 1 1 0
1 1 1
Task: Logic Circuit and Truth
Table
For the following logic circuit diagram state the logic the truth table. You may
add more columns to the truth tables to help.
Solve the logic statement and truth table for the circuit below:
Logic Statement:
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
Task 1 1 0
1 1 1
Task: Logic Circuit and Truth
Table
For the following logic circuit diagram state the logic the truth table. You may
add more columns to the truth tables to help.
Solve the logic statement and truth table for the circuit below:
Logic Statement:
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
Task 1 1 0
1 1 1
Reversing a Truth Table
If you have a truth table, can you work out the logic
statement / diagram?
A B C ?
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 0
1 0 1 0
1 1 0 1
Teac
her
Exp l 1 1 1 0
anat
i
on
Reversing a Truth Table
Step 1:
Look at any rows where the ‘answer column’ has a 1 in.
A B C ?
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 0
1 0 1 0
1 1 0 1
Teac
her 1 1 1 0
Exp l
anat
i
on
Reversing a Truth Table
Step 2:
Going through each of these highlighted rows write out the statement that
matches what the table is displaying.
A B C ?
0 0 0 0
0 0 1 0
0 1 0 0 A = 0, B = 1, C = 1 = 1
0 1 1 1
This means that
1 0 0 0 NOT A AND (B AND C) = 1
1 0 1 0 A = 1, B = 1, C = 0 = 1
1 1 0 1
Teac This means that
her
Exp l 1 1 1 0 (A AND B) AND NOT C = 1
anat
i
on
Reversing a Truth Table
Step 3:
For each of the statements, append them to one another and add an OR in
between.
A B C ?
0 0 0 0 NOT A AND (B AND C)
0 0 1 0
0 1 0 0 (A AND B) AND NOT C
0 1 1 1
1 0 0 0
1 0 1 0
1 1 0 1
Teac
her
Exp l 1 1 1 0
anat
i
on
Reversing a Truth Table
Step 3:
For each of the statements, append them to one another and add an OR in
between.
A B C ?
0 0 0 0 NOT A AND (B AND C)
0 0 1 0
0 1 0 0 (A AND B) AND NOT C
0 1 1 1
1 0 0 0
1 0 1 0
NOT A AND (B AND C)
1 1 0 1
OR
Teac
Exp l
her
1 1 1 0 (A AND B) AND NOT C
anat
i
on
Reversing a Truth Table
Step 4:
Add equals X (= X) or equivalent to the end of the statement .
Teac
her
Exp l
anat
i
on
Task: Reversing a Truth Table
Challenge
Look at the given truth table and try to construct the correct logic statement. 1
Logic Statement:
Q R S V
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 1
1 0 1 0
1 1 0 0
Task
1 1 1 0
Task: Reversing a Truth Table Challenge 2
Look at the given truth table and try to construct the correct logic statement.
Logic Statement:
A B C X
0 0 0 1
0 0 1 0
0 1 0 1
0 1 1 0
1 0 0 0
1 0 1 0
1 1 0 0
Task
1 1 1 1
Useful Links
Please utilise the following resources to aid your understanding:
Link
s
Walkthrough – Feedback &
What issues did you identify with the video? Develop
Task Overview
You have been asked to develop a walkthrough video for Y10 CS students
Your job is to record a short/snappy, engaging video which helps to explain how
to successfully answer the exam question
You may use: iPads, Laptops, PC's, headphones, paper, animation etc
1. Engaging
2. Accurate (Correct answer achieved)
Link
s
Video: Boolean Logic
Vide
o
Plenary Task 1
Assess yourself on your logic gates skills so far…
Plen
a ry
Plenary Task 2
Assess yourself on your logic gates skills so far…
Which gate?
or
Work
Exam ed
ple
Worked Examples: Worded
Exam Q’s
An output signal (X = 1) will occur if R and S are
both in the ON position
AN
OR D
NO or AN
T D
if R is in the OFF position and S and T are both in
the ON position.
AN
D
Work
Step 1:
Exam ed Locate all the gates in the
ple
statement.
Worked Examples: Worded
Exam Q’s
An output signal (X = 1) will occur if R and S are both in the
ON position
or
(R AND S) = X
Step 2 :
Work
Exam ed Gate-by-Gate build up the
ple
statement
Worked Examples: Worded
Exam Q’s
An output signal (X = 1) will occur if R and S are both in the
ON position
or
(R AND S) OR = X
Step 2 :
Work
Exam ed Gate-by-Gate build up the
ple
statement
Worked Examples: Worded
Exam Q’s
An output signal (X = 1) will occur if R and S are both in the
ON position
or
(R AND S) OR ((NOT R) = X
Step 2 :
Work
Exam ed Gate-by-Gate build up the
ple
statement
Worked Examples: Worded
Exam Q’s
An output signal (X = 1) will occur if R and S are both in the
ON position
or
Step 2 :
Work
Exam ed Gate-by-Gate build up the
ple
statement
Worked Examples: Worded
Exam Q’s
(R AND S) OR ((NOT R) AND (S AND T))= X
S X
T
Work
Exam ed
ple
Worked Examples: Worded
Exam Q’s
(R AND S) OR ((NOT R) AND (S AND T))= X
NOT R
R S T R AND
S
NOT
R
S AND
T
AND (S X
AND T)
0 0 0 0 1 0 0 0
0 0 1 0 1 0 1 1
0 1 0 0 1 0 0 0
0 1 1 0 1 1 1 0
1 0 0 0 0 0 0 0
1 0 1 0 0 0 0 0
1 1 0 1 0 0 0 1
1 1 1 1 0 1 0 1
Work
Exam ed
ple
Task: Past Paper Q’s
A manufacturing process receives a STOP signal (i.e. X = 1) depending on
certain conditions, shown in the following table:
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
Task
Task: Past Paper Q’s
A chemical process gives out a warning signal (W = 1) when the process
operates incorrectly.
A logic circuit (network) is used to monitor the process and to determine
whether W = 1.
Complete the logic statement, truth table, and circuit diagram on the
Task: Past Paper Q’s
Logic Statement:
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
Task
Task: Past Paper Q’s
A warning signal (S = 1) will be produced when any of the following occurs:
Complete the logic statement, truth table, and circuit diagram on the
next slide>>
Task
Task: Past Paper Q’s
Logic Statement:
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
Task
Worked Examples: Worded
Exam Q’s
A manufacturing process receives a STOP signal (i.e. X = 1) depending on certain
conditions, shown in the following table:
Work V=X
Exam ed
ple
Worked Examples: Worded
Exam Q’s
Work
Exam ed (V AND NOT S) OR = X
ple
Worked Examples: Worded
Exam Q’s
Work
Exam ed (V AND NOT S) OR (NOT T = X
ple
Worked Examples: Worded
Exam Q’s
Work
Exam ed (V AND NOT S) OR (NOT T AND S) = X
ple
Worked Examples: Worded
Exam Q’s
S X
T
Work
Exam ed
ple
Task: Past Paper Q’s
Task
S15P11
Feedback: Past Paper Q’s
Task
S15P11
Task: Past Paper Q’s
Task
S15P12
Feedback: Past Paper Q’s
Task
S15P12
Task: Past Paper Q’s
Task
S16P11
Feedback: Past Paper Q’s
Task
S16P11
Task: Past Paper Q’s
Task
S16P12
Feedback: Past Paper Q’s
Task
S16P12
Task: Past Paper Q’s
Task
W16P11
Feedback: Past Paper Q’s
Task
W16P11
Task: Past Paper Q’s
Task
W16P12
Feedback: Past Paper Q’s
Task
W16P12
Task: Past Paper Q’s
Task
M17P12
Feedback: Past Paper Q’s
Task
M17P12
Task: Past Paper Q’s
Task
S17P11
Feedback: Past Paper Q’s
Task
S17P11
Task: Past Paper Q’s
Task
S17P12
Feedback: Past Paper Q’s
Task
S17P12
Task: Past Paper Q’s
Task
W17P11
Feedback: Past Paper Q’s
Task
W17P11
Task: Past Paper Q’s
Task
M18P12
Feedback: Past Paper Q’s
Task
M18P12
Task: Past Paper Q’s
Task
S18P11
Feedback: Past Paper Q’s
Task
S18P11
Task: Past Paper Q’s
Task
S18P12
Feedback: Past Paper Q’s
Task
S18P12
Task: Past Paper Q’s
Task
S18P13
Feedback: Past Paper Q’s
Task
S18P13
Task: Past Paper Q’s
Task
W18P11
Feedback: Past Paper Q’s
Task
W18P11
Task: Past Paper Q’s
Task
W18P12
Feedback: Past Paper Q’s
Task
W18P12
Task: Past Paper Q’s
Task
W18P13
Feedback: Past Paper Q’s
Task
W18P12