Chapter 10 Logic gates and circuits

10.1 Boolean Logic

Exercise 1

1. To control the flow of electricity by changing the current from low (0) to high (1) or
vice versa.

2. Computers can only process binary data, but there needs to be a way to convert
from 0 to 1 and 1 to 0 so that this binary data can be represented and stored.

3.

Name of logic gate Logic gate symbol Truth table

NOT
Input Output
0 1
1 0

AND
Input 1 Input 2 Output
0 0 0
0 1 0
1 0 0
1 1 1

OR
Input 1 Input 2 Output
0 0 0
0 1 1
1 0 1
1 1 1
NAND
Input 1 Input 2 Output
0 0 1
0 1 1
1 0 1
1 1 0

NOR Input 1 Input 2 Output

0 0 1
0 1 0
1 0 0
1 1 0
 XOR
Input 1 Input 2 Output
0 0 0
0 1 1
1 0 1
1 1 0

4. NOT
5. OR
6. AND
7. XOR
8.

9.

Exercise 2
1(a).

1(b).

A B C Working space X

0 0 0 0
0 0 1 1
 0 1 0 1

0 1 1 1

1 0 0 1

1 0 1 1

1 1 0 1

1 1 1 1

X
B

C
3(a).

S
Z

3(b).

P S T Working space Z

0 0 0 1
 0 0 1 1

0 1 0 0

0 1 1 1

1 0 0 1

1 0 1 1

1 1 0 1

1 1 1 0

Exercise 3
1(a).

X = A AND (B OR C)

1(b).

B
X

1(c)

A B C Working space X

0 0 0 0

0 0 1 0
 0 1 0 0

0 1 1 0

1 0 0 0

1 0 1 1

1 1 0 1

1 1 1 1

2(a)

X= NOT H AND T) OR (H AND NOT F)

2(b).

T X

2(c).

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 1

1 0 1 0

1 1 0 1

1 1 1 0

Exercise 4
1.

X = (A AND B) NAND C

2.

Z = (NOT W AND X) NOR NOT Y

3(a).

X = ((P AND R) NOT) XOR (NOT S NOR R)

3(b).

P R S 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 1

1 1 0 0

1 1 1 0

Exercise 5
1.

X = A AND NOT B

2(a).

X = (A AND NOT B) OR (A AND B)

2(b).

3.
Z = (NOT A AND NOT B AND C) OR (A AND B AND NOT C) OR (A AND B AND C)