LOGIC AUTOMATISMS

MR2000

Module 1, Homework 2
Logic gates and Boolean algebra

1. Simplify the following Boolean expressions to a minimum number of literals:

a. 𝑋𝑌 + 𝑋𝑌̅
b. (𝑋 + 𝑌)(𝑋 + 𝑌̅)
c. 𝑋𝑌𝑍 + 𝑋̅𝑌 + 𝑋𝑌𝑍̅
2. Draw logic diagrams of the circuits that implement the original and simplified
expressions in problem 1.
3. Obtain the truth table of the following functions, and express each function in sum-of-
minterms and product-of-maxterms form:
a. (𝐵 + 𝐶𝐷)(𝐶 + 𝐵𝐷)
b. (𝐶𝐷 + 𝐵̅ 𝐶 + 𝐵𝐷 ̅ )(𝐵 + 𝐷)
c. (𝐶̅ + 𝐷)(𝐵 + 𝐶̅ )
4. Determine whether the following Boolean equation is true or false and show your
procedure:
𝑋̅𝑌̅ + 𝑋̅𝑍 + 𝑋̅𝑍̅ = 𝑋̅𝑍̅ + 𝑌̅𝑍̅ + 𝑋̅𝑍
5. Write Boolean expressions and construct the truth tables describing the outputs of the
circuits described by the logic diagrams in Figure 1.

Figure 1. Logic circuits for problem 21

6. Write the following Boolean expression in sum of products form:

(𝐵 + 𝐷)(𝐴̅ + 𝐵̅ + 𝐶)
7. Write the following Boolean expression in product of sums form:
𝐴̅𝐵 + 𝐴̅𝐶̅ + 𝐴𝐵𝐶
8. Draw logic diagrams (using AND, OR and NOT gates) of the circuits using simplified
expressions (simplify them using Karnaugh maps) of the following functions:
a. 𝑌 = 𝐴̅𝐵𝐶 + 𝐴𝐵̅ 𝐶̅ + 𝐴𝐵𝐶.
b. 𝑌 = ∑(0,3,4,5,7,10,11).
c. 𝐹 = ∑(1,2,4,5).
d. 𝐹 = 𝑊𝑋̅𝑌𝑍 + 𝑊 ̅ 𝑋̅𝑌𝑍 + 𝑊𝑋̅𝑌̅𝑍 + 𝑊
̅ 𝑋𝑌𝑍 + 𝑊𝑋̅𝑌̅𝑍̅ + 𝑊𝑋𝑌𝑍
9. Repeat problem 8 but using only NAND gates and De Morgan theorems.