Questions

Question 1
Identify each of these logic gates by name, and complete their respective truth tables:

A A A
Output Output Output
B B B
A B Output A B Output A B Output
0 0 0 0 0 0
0 1 0 1 0 1
1 0 1 0 1 0
1 1 1 1 1 1

A A
Output Output A Output
B B

A B Output A B Output A Output

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

A A A
Output Output Output
B B B

A B Output A B Output A B Output

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

file 02776

2
Question 9
Write the Boolean expression for each of these logic gates, showing how the output (Q) algebraically
relates to the inputs (A and B):

A A
Q Q A Q
B B

Q = Q = Q =

A A A
Q Q Q
B B B

Q = Q = Q =

A
Q
B

Q =

file 02778

8
Question 23
Like real-number algebra, Boolean algebra is subject to the laws of commutation, association, and
distribution. These laws allow us to build different logic circuits that perform the same logic function.
For each of the equivalent circuit pairs shown, write the corresponding Boolean law next to it:

A B B A

A A
B B
C C

A
A
B C
C
B

A B
B A

A B A B

C C B

A A
B B
C C

Note: the three short, parallel lines represent ”equivalent to” in mathematics.
file 01303

17
Question 36
Use Boolean algebra to simplify the following logic gate circuit:

A
Output
B

file 02797

Question 37
Use Boolean algebra to simplify the following logic gate circuit:

Output

file 02799

Question 38
Use Boolean algebra to simplify the following relay (ladder logic) circuit:

L1 L2

A A B

file 02812

25
Question 48
Sum-of-Products (SOP) expressions may be implemented by a combination of AND and OR gates, as
such:

A
B
AB + CD
C
D

Use DeMorgan’s Theorem to prove that this NAND gate circuit performs the exact same function:

A
B
C
D

file 02860

Question 49
Use Boolean algebra to simplify the following logic gate circuit:

Output
A
B

file 02798

29