Course: ECE222 - Digital Logic Design Lecturers: Hossam Shalaby
Semester: Spring 2020. Assistant: Mahmoud Khodier
Assignment 3: Boolean Algebra and Logic Gates
1) Simplify the following Boolean expressions to a minimum number of literals:
a. 𝑨𝑩𝑪 + 𝑨′𝑩 + 𝑨𝑩𝑪′.
b. 𝒙′𝒚𝒛 + 𝒙𝒛.
c. (𝒙 + 𝒚)′ (𝒙′ + 𝒚′).
d. 𝒙𝒚 + 𝒙(𝒘𝒛 + 𝒘𝒛′).
e. (𝑩𝑪′ + 𝑨′𝑫) (𝑨𝑩′ + 𝑪𝑫′).
f. (𝒂′ + 𝒄′) (𝒂 + 𝒃′ + 𝒄′).
2) Reduce the following Boolean expressions to the indicated number of literals:
a. 𝑨′𝑪′ + 𝑨𝑩𝑪 + 𝑨𝑪′ to three literals.
b. (𝒙′𝒚′ + 𝒛)′ + 𝒛 + 𝒙𝒚 + 𝒘𝒛 to three literals.
c. 𝑨′𝑩(𝑫′ + 𝑪′𝑫) + 𝑩(𝑨 + 𝑨′𝑪𝑫) to one literal.
d. (𝑨′ + 𝑪) (𝑨′ + 𝑪′) (𝑨 + 𝑩 + 𝑪′𝑫) to four literals.
e. 𝑨𝑩𝑪′𝑫 + 𝑨′𝑩𝑫 + 𝑨𝑩𝑪𝑫 to two literals.
3) Find the complement of the following expressions:
a. 𝒙𝒚′ + 𝒙′𝒚.
b. (𝒂 + 𝒄) (𝒂 + 𝒃′) (𝒂′ + 𝒃 + 𝒄′).
c. 𝒛 + 𝒛′(𝒗′𝒘 + 𝒙𝒚).
4) List the truth table of the function:
a. 𝑭 = 𝒙𝒚 + 𝒙𝒚′ + 𝒚′𝒛.
b. 𝑭 = 𝒃𝒄 + 𝒂′𝒄′.
5) Draw logic diagrams to implement the following Boolean expressions:
a. 𝒚 = (𝒖 + 𝒙′) (𝒚′ + 𝒛).
b. 𝒚 = (𝒖′ 𝒚)′ + 𝒙.
c. 𝒚 = (𝒖′ + 𝒙′) (𝒚 + 𝒛′).
d. 𝒚 = 𝒖(𝒙 ′ 𝒛) + 𝒚′.
e. 𝒚 = 𝒖 + 𝒚𝒛 + 𝒖𝒙𝒚.
f. 𝒚 = 𝒖 + 𝒙 + 𝒙′(𝒖 + 𝒚′).
6) Implement the Boolean function 𝑭 = 𝒙𝒚 + 𝒙′𝒚′ + 𝒚′𝒛 with:
a. AND, OR, and inverter gates.
b. OR and inverter gates.
c. NOR and inverter gates.
d. AND and inverter gates.
e. NAND and inverter gates.
Page 1 of 2
7) Simplify the following Boolean functions 𝑻𝟏 and 𝑻𝟐 to a minimum number of literals:
8) Express the following function as a sum of minterms and as a product of maxterms:
𝑭(𝑨, 𝑩, 𝑪, 𝑫) = 𝑩′ 𝑫 + 𝑨′ 𝑫 + 𝑩𝑫.
9) Obtain the truth table of the following functions, and express each function in sum‐of‐
minterms and product‐of‐maxterms form:
a. (𝒃 + 𝒄𝒅)(𝒄 + 𝒃𝒅).
b. (𝒄𝒅 + 𝒃′𝒄 + 𝒃𝒅′)(𝒃 + 𝒅).
c. (𝒄′ + 𝒅)(𝒃 + 𝒄′).
d. 𝒃𝒅′ + 𝒂𝒄𝒅′ + 𝒂𝒃′𝒄 + 𝒂′𝒄′.
10) Express the complement of the following functions F’ in sum‐of‐minterms form:
a. 𝑭(𝑨, 𝑩 , 𝑪, 𝑫) = ∑(𝟐, 𝟒, 𝟕, 𝟏𝟎, 𝟏𝟐, 𝟏𝟒).
b. 𝑭 ( 𝒙, 𝒚, 𝒛 ) = ∏(𝟑, 𝟓, 𝟕).
11) Convert each of the following to the other canonical form:
a. 𝑭(𝒙, 𝒚, 𝒛) = ∑(𝟏, 𝟑, 𝟓).
b. 𝑭(𝑨, 𝑩, 𝑪, 𝑫) = ∏(𝟑, 𝟓, 𝟖, 𝟏𝟏).
Page 2 of 2
