Solution

to EG1108 Tutorial 7

1. Simplify the following Boolean expressions using rules of Boolean Algebra and De Morgan’s
theorems:

i. F  ( A  B)  ( A  B)
 A A  A B  B  A  B  B
 A  A B  B  0
 A  A 1  A

ii. F  ( A  B )  (C  D )  C

 ( A  B )  (C  D )  C

 A B  C  D  C

 A B  C  D  C

 
 A B  C  D 1  A B  C

EG1108 PART 2 EXERCISES ~ PAGE 1 BEN M. CHEN, NUS ECE

 iii. F  A B C  A B C  AC  A B  D  B C

 
 A B C  A B  A C  A B  D  B C

 A  B  C   B  A  C  A  B  D  B  C Rule 18

 A B C  B C  AC  A B  D  B C


 A B C  AC  A B  D  B  B C 
 A B C  AC  A B  D  C

 
 A B C  A 1 C  A B  D

  A B C  C  A B  D Rule 18

 A B  C  A B  D

 
 B  A  A D  C Rule 18

 B  A  D  C
Rule 18: A  A B  A  B
EG1108 PART 2 EXERCISES ~ PAGE 2 BEN M. CHEN, NUS ECE
 iv. F  A  B  A B  B C

 A B  A B  B C
 
 A  A  B  B C
 B  B C Rule 18
 BC
 B C

v. F  ( A  B)  ( A  C )  ( B  C )

 ( A  B)  ( A  C )  ( B  C )

 A B  A  C  B C


 B  A  1 B C Rule 18

 A BC

Rule 18: A  A B  A  B
EG1108 PART 2 EXERCISES ~ PAGE 3 BEN M. CHEN, NUS ECE
 2. Derive the Boolean functions for the combinatorial network shown in figures below.
i)

A
A B

A C Z  A B  A C  BC

BC

ii)

X Y X Y
F4  ( X  Y )  ( Z  Y )

 X Y  Z Y
Z Y  X Y Y  Z
 X Y
EG1108 PART 2 EXERCISES ~ PAGE 4 BEN M. CHEN, NUS ECE
 Z  A B .
3. Use only NOR gates with 2 inputs to implement the exclusive OR function

Z  A  B  ( A  B)  ( A  B) (see Example 4 in the lecture notes)

 ( A  B)  ( A  B)

 ( A  B)  ( A  B)

 ( A  B)  ( A  B)

A B

A B B
( A  B)  ( A  B)

A B

EG1108 PART 2 EXERCISES ~ PAGE 5 BEN M. CHEN, NUS ECE

 Z  A B
4. Use only NAND gates with 2 inputs to implement the exclusive NOR function

Z  A  B  ( A  B)  ( A  B)  ( A  B)  ( A  B)  ( A  B)  ( A  B)

A B

A B B
( A  B)  ( A  B)

A B
A

EG1108 PART 2 EXERCISES ~ PAGE 6 BEN M. CHEN, NUS ECE

 5. The logic circuit below is known as a parity checker for a 4‐bit binary number.
i. Construct a truth table for the circuit.

A B E C G D F No: High Inputs E

0 0 0 0 0 0 0
0 0 0 0 0 1 1 1 G
0 0 0 1 1 0 1 1
0 0 0 1 1 1 0 F
0 1 1 0 1 0 1 1
0 1 1 0 1 1 0
0 1 1 1 0 0 0
0 1 1 1 0 1 1 3 It is clear from the truth table on the left
1 0 1 0 1 0 1 1 that F is high if and only if the number of
1 0 1 0 1 1 0 the input variables, which are high, is
1 0 1 1 0 0 0
either 1 or 3, an odd number. This
1 0 1 1 0 1 1 3
1 1 0 0 0 0 0 procedure can be extended to check parity
1 1 0 0 0 1 1 3 for a binary number with more bits…
1 1 0 1 1 0 1 3
1 1 0 1 1 1 0

ii. Verify that F is true if and only if the number of the inputs that are high is either 1
or 3.
EG1108 PART 2 EXERCISES ~ PAGE 7 BEN M. CHEN, NUS ECE