0% found this document useful (0 votes)
60 views10 pages

Chapter 10 - Logic Gate

Uploaded by

shamim.arefin
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
60 views10 pages

Chapter 10 - Logic Gate

Uploaded by

shamim.arefin
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

10 Boolean logic

1 State the logic gate each truth table represents.

a b A B X
c A B X
A B X

0 0 0 0 0 1 0 0 0

0 1 1 0 1 1 0 1 1

1 0 1 1 0 1 1 0 1

1 1 1 1 1 0 1 1 0

...............................................
............................................... D:\Education\CAMBRIDGE_IGCSE_Computer ...............................................
Science\IGCSE

2 Complete the truth table for this logic circuit.

A
B

A B C Working area 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

Cambridge IGCSE and O Level Computer Science Algorithms, Programming and Logic Workbook Samsul Arefin Shamim 63
10 Boolean logic

3 a Write the following statement as a logic expression:

X is 1 if A and B are on or if B is off and C is on

............................................................................................................................. ..............................................

............................................................................................................................. ..............................................

b Draw the logic circuit to represent the statement in part a.

4 a Complete the truth table for the following logic circuit:

A B Working area X
0 0
0 1
1 0
1 1

b Which single logic gate is represented by the truth table in part a?

............................................................................................................................. ....................................................

Samsul Arefin Shamim Cambridge IGCSE and O Level Computer Science Algorithms, Programming and Logic Workbook
64
10 Boolean logic

5 a Complete the truth table for the following logic circuit:


A

A B C Working area 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

b How might the logic circuit in part a be simplified?

............................................................................................................................. ....................................................

.................................................................................................................................................................................

6 a Complete the truth table for this logic circuit:

B X

A B C Working area 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

Cambridge IGCSE and O Level Computer Science Algorithms, Programming and Logic Workbook Photocopying prohibited
65
10 Boolean logic

b What single logic gate could replace this logic circuit?


A
B

............................................................................................................................. ..............................................

7 a Write down the logic expression to represent the following logic circuit:
A

B X

............................................................................................................................. ..............................................

............................................................................................................................. ..............................................

............................................................................................................................. ..............................................

...........................................................................................................................................................................

............................................................................................................................. ..............................................

b Draw the logic circuit which corresponds to the following truth table:

A B C X
0 0 0 1
0 0 1 0
0 1 0 1
0 1 1 1
1 0 0 1
1 0 1 0
1 1 0 1
1 1 1 1

B X

Samsul Arefin Shamim Cambridge IGCSE and O Level Computer Science Algorithms, Programming and Logic Workbook
66
10 Boolean logic

8 A chemical process is monitored using a logic circuit. There are three inputs to the logic circuit
representing the parameters being monitored in the chemical process. An alarm, X, will give an
output value of 1 depending on certain conditions.

The following table describes the process conditions being monitored.

Parameter description Parameter Binary value Description of condition


Reaction temperature T 0 Temperature > 120 °C
1 Temperature <= 120 °C
Pressure of CO gas evolved P 0 Pressure > 2 bars
1 Pressure <= 2 bars
Acid concentration A 0 Acid concentration > 4 moles
1 Acid concentration <= 4 moles

An alarm, X, will generate the value 1 if:


either temperature > 120 °C and acid concentration <= 4 moles
or temperature <= 120 °C and gas pressure <= 2 bars
or acid concentration > 4 moles and gas pressure <= 2 bars

a Write the logic expression to represent the above system.

............................................................................................................................. ..............................................

...........................................................................................................................................................................

............................................................................................................................. ..............................................

...........................................................................................................................................................................

............................................................................................................................. ..............................................

b Draw the logic circuit to represent the above system.

A X

Cambridge IGCSE and O Level Computer Science Algorithms, Programming and Logic Workbook Photocopying prohibited
67
10 Boolean logic

c Complete the truth table to represent the above system.

T A P Working area 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

9 A safety system uses the input from three sensors A, B and C. The binary values from these sensors
form the input to a logic circuit.

The output, X, from the logic circuit is 1 if:


either A is 1 and B is 1
or A is 0 and C is 1
or B is 0 and C is 1

Sensor A
Sensor B Logic circuit 'X' Output, X, from logic circuit
Sensor C

a Draw the logic circuit to represent the above system.

B X

Samsul Arefin Shamim Cambridge IGCSE and O Level Computer Science Algorithms, Programming and Logic Workbook
68
10 Boolean logic

b Complete the truth table for the above system.

A B C Working area 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

c For safety reasons, the sensors feed into three different logic circuits (numbered 1, 2 and 3)
which produce the outputs X, Y and Z. These three outputs then form the inputs to another
logic circuit which has the output Q.

The three logic circuits are connected to this extra logic circuit:

Logic Output X
circuit 1
inputs
from
the Output Y
Logic
three
circuit 2 Q
sensors
A, B
and C
Logic Output Z
circuit 3

Complete the truth table for this system.

X Y Z Working area Q
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1

Cambridge IGCSE and O Level Computer Science Algorithms, Programming and Logic Workbook Photocopying prohibited
69
10 Boolean logic

10 a Write a logic expression for the following logic circuit:

B X

b Complete the truth table for the logic circuit.

A B C Working area 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

11 a Write the logic expression for this truth table.

A B X
0 0 1
0 1 0
1 0 0
1 1 1

b Draw the logic circuit which is represented by the truth table.

Samsul Arefin Shamim Cambridge IGCSE and O Level Computer Science Algorithms, Programming and Logic Workbook
70
10 Boolean logic

12 a Draw a logic circuit for this logic expression. Each logic gate must have a maximum of
two inputs and the expression must not be simplified:

X = ((A NAND B) XOR C) OR (A NOR NOT C)

b Complete the truth table for the logic expression:

A B C Working area 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

You might also like