Chapter 10
Chapter 10
&+$37(5
3$*(
3$*(
He uses three different logic gates in his circuit. Each logic gate has a maximum of two inputs.
(a) “The only time the output will be 1 is when both inputs are 1.”
[2]
(b) “The only time the output will be 1 is when both inputs are 0.”
[2]
(c) “The only time the output will be 0 is when both inputs are 1.”
will
[2]
(a) Draw a logic circuit to match the given logic statement. Each logic gate used must have a
maximum of two inputs. Do not attempt to simplify the logic statement.
B X
[6]
((b)
b) Comp
mp
ple
lete
te the
Complete the truth
tru
ruth table forr the
the given logic statement.
Working space
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
1 1 1
[4]
X
B
............................................................................................................................................. [3]
(b) Complete the truth table forr the given logic circuit.
Working space
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
1 1 1
[4]
4 A factory that manufactures cleaning products has a system that monitors conditions throughout
the manufacturing process.
(a) The system will sound an alarm (X) when certain conditions are detected.
or
• The
Th
he temperature
te
emp
mper
errat
a ur
ure < 35 °C
°C and
an
nd the
th pH > 7
Draw
w a llogic
o ic ccircuit
og irrcu
c it to repres
e ent the alarm system in the factory. Each logic gate must have a
es
represent
ma
aximu
ximu
mum
maximum m of ttwo
wo iinputs.
n uts.
np
T X
[4]
(b) Complete the truth table for the given logic problem.
Working space
A T P X
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
[4]
(c) A sensor and a microprocessor are used to monitor the pH of the cleaning products. The
readin
system records each reading ng that is taken. If the reading is greater than 7 a warning message
r..
is displayed on a monitor.
....
.........
. .......
...........................................................................................................................
.. ................
................................................................................................................................................... ................
......
................
....
...
. ..
....
. ....
............................................................................................................................
...................................................................................................................................................
........
......
..............
. ...............................................................................................................................
...................................................................................................................................................
...........................................
..........................................................................................................
...................................................................................................................................................
............................................
........................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
............................................................................................................................................. [6]
All logic gates must have a maximum of two inputs. Do not attempt to simplify the logic
statement.
B X
[5]
Working space
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
1 1 1
[4]
4 (a) Identify the name and draw the single logic gate that can replace the given logic circuits.
(i)
A
X
B
[2]
(ii)
A
X
B
Name of gate: ……
……………………………
………
…………………… Drawing of gate:
[2]
(b) Co
ommp
ple
ete
Completee the
the
he truth
tru
uth
h table for
fo
or the
the given logic statement:
X = (((A OR
R C) AND (NOT A AND NOT C)) XOR B)
Working space
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
1 1 1
[4]
B X
[4]
(b)
b)) Co
C mple
mp ete the
Complete the truth
tru
ruth
th table from
th fro
om the
th
he given
give
gi
ive
ven
n logic
logi
logic
gi
ic expression.
expr
ex pres
pr esssi
sion
on..
on
Working space
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
1 1 1
[4]
&+$37(5
0$5.,1*
6&+(0(
3$*(
2210/11 Cambridge O Level – Mark Scheme May/June 2019
PUBLISHED
Question Answer Marks
Question Answer
Answ
wer Marks
2(a) 1 mark for correct name, 1 mark for correct gate symbol 2
AND
3$*(
2(b) 1 mark for correct name, 1 mark for correct gate symbol 2
NOR
2(c) 1 mark for correct name, 1 mark for correct gate symb
symbol
mbol
mb 2
NAND
8(a) 1 mark per each correct logic gate, with correct input(
input(s)
t(s)
t( s 6
3$*(
A B C Wo
W ork
r ing space
Working X
0 0 0 0
0 0 1 0
0 1 0 1
0 1 1 0
1 0 0 0
1 0 1 0
3$*(
1 1 0 1
1 1 1 1
x (B NAND NOTC)
A B C Working space X
0 0 0 1
0 0 1 1
0 1 0 0
0 1 1 1
1 0 0 1
1 0 1 1
3$*(
1 1 0 1
1 1 1 1
4(a) One mark for each correct logic gate with correct input(s)) 4
3$*(
A T P Working space X
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 0
1 0 0 0
1 0 1 1
3$*(
1 1 0 1
1 1 1 1
2(a) 5
A
B X
2(b) 4
A B C Working space X
0 0 0 1
0 0 1 0
0 1 0 1
0 1 1 0
1 0 0 1
1 0 1 0
1 1 0 1
1 1 1 0
3$*(
Question Answer
Answ
wer Marks
Question Answer
An swer
wer Marks
3$*(
4(a)(i) − NAND 2
4(a)(ii) − NOR 2
4(b) 4
A B C Working space X
0 0 0 0
0 0 1 0
0 1 0 1
0 1 1 1
1 0 0 0
1 0 1 0
1 1 0 1
1 1 1 1
4 marks for 8 correct outputs
3$*(
Question Answer
An swer
wer
e Marks
B X
6(b) 4
A B C X
0 0 0 0
0 0 1 0
3$*(
0 1 0 1
0 1 1 0
1 0 0 0
1 0 1 0
1 1 0 1
1 1 1 1