Memorial University of Newfoundland

Electrical and Computer Engineering

ENGI 3861 - Digital Logic

Fall 2019

Problem Set 1:
Boolean Algebra and Circuit Minimization
Target Completion Date: September 20

Question 1:

Convert the following unsigned binary numbers to their decimal equivalent value.
(a) 101110102 (b) 10111.011012 (c) 11101001.101001012

Question 2:

(a) Convert the following octal numbers into binary and hexadecimal.
(i) 1657718 (ii) 5673608
(b) Convert the following hexadecimal numbers into binary and octal.
(i) 3F9A16 (ii) FDCB16 (iii) 123B.A116
(c) Convert the following into decimal.
(i) 34768 (ii) A9E216
(d) Convert the following decimal numbers into hexadecimal.
(i) 576910 (ii) 87642010

Question 3:

Convert the decimal number “10.86” to the closest possible binary representation (i.e.,
which has the smallest error), assuming 4 bits to the left of the binary point and 3 bits to
the right of the binary point in the representation. What is the error in the binary
representation?

Question 4:

Using Boolean algebra, derive a minimized sum-of-product expression for

(a) F = [(X'+Z')(Y+Z')(X'+Z)]'

(b) F = X'Z + XY'Z + XYZ

(c) F = X'Y'Z' + X'Y'Z + X'YZ + X'YZ'

(d) F = [(XY' + (XYZ)')⋅(XZ)'⋅(Y+Z)']'

1
Question 5:

(a) Using Boolean algebra, prove that

XYZ + X'Y'Z + X'YZ + X'YZ' + XY'Z = X'Y+ Z.
(b) Using Boolean algebra, prove that XY + YZ + X'Z = XY + X'Z. This property is
sometimes referred to as "consensus". (Hint: Expand both sides to the standard
SOP form and show that they are the same.)

Question 6:

(a) Consider the following logic circuit.

(i) Complete the truth table for output F.

(ii) Write the canonical sum-of-products representation for F.
(iii) Using Boolean algebra, determine a minimized sum-of-products
representation for F.

(b) Consider the following logic circuit.

(i) Write the Boolean function F directly from the circuit.

(ii) Using Boolean algebra, show that F can be simplified to a 3 input standard
gate.

Question 7:

Consider the following Boolean expression: 𝐹 = 𝑊 + 𝑋 ⨁(𝑌 + 𝑍).

(a) Draw a direct realization.
(b) Draw a circuit realization which uses only 2-input NAND gates.
(c) Using NAND, NOR, and NOT gates, draw a circuit using fewer gates that achieves
the same functionality.

2
Question 8:

Consider the following logic circuit:

(a) Directly from the circuit above, write an expression for the Boolean function
represented by the circuit. (Do not simplify the expression in any way.)
(b) Complete the truth table for the output F.
(c) Using Boolean algebra directly on the expression in (a), determine the most simplified
sum-of-products representation for F.
(d) Using Boolean algebra directly on the expression in (c), determine the most simplified
product-of-sums representation for Fʹ′.

Question 9:

Consider the following truth table:

XYZ F
000 0
001 0
010 1
011 1
100 1
101 1
110 0
111 0

(a) Write the canonical sum-of-products form of the function F.

(b) Using a Karnaugh map, determine the minimized sum-of-products for F.
(c) Using Boolean algebra, from your answer in (b), determine the minimized sum-of-
products for Fʹ′, that is, the inverse of F.
(d) Draw the circuit for Fʹ′ using the smallest number of gates from the set of standard
gates that we learned about in class.

3
Question 10:

Consider the following Boolean function:

F = Bʹ′Cʹ′Dʹ′ + ABCʹ′Dʹ′ + AC + Aʹ′CD + Aʹ′Bʹ′CDʹ′ + Aʹ′Bʹ′D

(a) Complete the truth table for the function.

(b) Write the canonical sum-of-products form of F.
(c) Write the canonical product-of-sums form of F.
(d) Using a Karnaugh map, determine the minimized sum-of-products representation of
the function F.

Question 11:

(a) Consider the following Boolean function represented in its canonical sum-of-products
form: 𝐹 = !"#$ 0,1,2,3,7,10,14 + 𝑑(4,6)
where the list of d(…) indicates “don’t care” terms.
Complete the Karnaugh map for the system and determine a minimized sum-of-
products expression for F, directly from the K-map.

(b) Now assume that a Boolean function G is represented in its canonical product-of-
sums form as: 𝐺 = !"#$ 5,11,13,15 + 𝑑(7,9)
Complete the Karnaugh map for the system and determine a minimized product-
of-sums expression for G, directly from the K-map.

(c) For part (b), determine a minimized sum-of-products expression for G. How does it
compare to the answer for (b)?

Question 12:

Consider the following truth table.

WXYZ F WXYZ F
0000 0 1000 0
0001 1 1001 1
0010 1 1010 1
0011 X 1011 0
0100 0 1100 1
0101 1 1101 1
0110 X 1110 1
0111 0 1111 X

(a) Determine a minimized sum-of-products expression for F using a K-map.

(b) Determine a simple realization for F using only three 2-input standard gates. Draw the
resulting circuit.