UNIT 10 BOOLEAN LOGIC
0478
COMPUTER SCIENCE
TOPIC QUESTION PAPER-2 SET-2
SMART EXAM RESOURCES
UNIT 10 BOOLEAN LOGIC
1. Consider the logic statement:
X = ((((NOT A AND B) OR C) AND B) NOR (B OR C))
(a) Draw a logic circuit to represent the given logic statement.
Do not attempt to simplify the statement. All logic gates must have a maximum of two
inputs.
[6]
0478 COMPUTER SCIENCE Topic Questions and Mark Scheme 1
UNIT 10 BOOLEAN LOGIC
(b) Consider the completed truth table for the given logic statement.
There are four errors in the truth table in the output (X) column. Identify the four incorrect
outputs.
Write the row number to identify each incorrect output.
Row .......................
Row .......................
Row .......................
Row ....................... [4]
0478 COMPUTER SCIENCE Topic Questions and Mark Scheme 2
UNIT 10 BOOLEAN LOGIC
2. Consider the following logic circuit:
(a) Two NOT gates are used in the given logic circuit.
Identify three other logic gates that are used in the given logic circuit.
1................................................................................................................................................
2................................................................................................................................................
3.........................................................................................................................................[3]
(b) Consider the completed truth table for the given logic circuit.
0478 COMPUTER SCIENCE Topic Questions and Mark Scheme 3
UNIT 10 BOOLEAN LOGIC
There are four errors in the truth table in the output (X) column. Identify the four incorrect
outputs.
Write the row number to identify each incorrect output.
Row .......................
Row .......................
Row .......................
Row ....................... [4]
0478 COMPUTER SCIENCE Topic Questions and Mark Scheme 4
UNIT 10 BOOLEAN LOGIC
3. Consider the following logic statement:
X = (((A OR B) OR (NOT (B XOR C))) AND C)
(a) Draw a logic circuit to represent the given logic statement.
Do not attempt to simplify the logic statement. All logic gates must have a maximum of two
inputs.
[5]
(b) State the name of a logic gate that does not appear in the logic statement and draw the
symbol for the logic gate.
Name of logic gate ................................... Logic gate symbol:
[2]
0478 COMPUTER SCIENCE Topic Questions and Mark Scheme 5
UNIT 10 BOOLEAN LOGIC
(c) Complete the truth table for the given logic statement.
A B C Working space 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]
0478 COMPUTER SCIENCE Topic Questions and Mark Scheme 6
UNIT 10 BOOLEAN LOGIC
4. Consider the following logic statement:
X = (((A AND B) OR (NOT (B OR C))) NAND C)
(a) Draw a logic circuit to represent the given logic statement.
Do not attempt to simplify the logic statement. All logic gates must have a maximum of
two
inputs.
[5]
0478 COMPUTER SCIENCE Topic Questions and Mark Scheme 7
UNIT 10 BOOLEAN LOGIC
(b) Complete the truth table for the given logic statement.
A B C Working space X
0 0 0
0 0 1
0 1 0
[4]
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
(c) Identify two logic gates that are not included in the given logic statement.
Logic gate 1 ...............................................................................................................................
Logic gate 2 .........................................................................................................................[2]
0478 COMPUTER SCIENCE Topic Questions and Mark Scheme 8
UNIT 10 BOOLEAN LOGIC
5. Consider the following logic statement:
X = (((A OR B) AND (NOT(B XOR C))) OR NOT C)
(a) Draw a logic circuit to represent the given logic statement.
Do not attempt to simplify the logic statement. All logic gates must have a maximum of
two inputs.
[6]
(b) Complete the truth table for 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]
0478 COMPUTER SCIENCE Topic Questions and Mark Scheme 9
UNIT 10 BOOLEAN LOGIC
6. (a) Complete the truth table for the given logic circuit.
Do not attempt to simplify the 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]
0478 COMPUTER SCIENCE Topic Questions and Mark Scheme 10
UNIT 10 BOOLEAN LOGIC
(b) A water control system uses a switch and two pressure sensors.
The outputs of the switch and sensors are shown in the table.
Sensor or Switch Output of 1 Output of 0
Switch
On Off
(S1)
Pressure Sensor
>= 3 <3
(P1)
Pressure Sensor
>= 3 <3
(P2)
Create a logic circuit that will produce an output (X) of 1 when:
The switch S1 is on
and
either P1 is less than 3 or P2 is less than 3, but not both.
All logic gates used must have a maximum of two inputs.
[4]
0478 COMPUTER SCIENCE Topic Questions and Mark Scheme 11
