Digital Logic Homework
University of Information Technology

Computer Engineering Faculty
Page 1
Homework3
1. Simplify the following Boolean expressions using only the Boolean
theorems in the notes to a minimum number of literals:
a. ABC + ABC’ + A’B
b. (A + B)’(A’ + B’)
c. (A + B’ + AB’)(AB + A’C + BC)
d. ((A + B)C’+AB’)B’D
2. For the Boolean functions E and F, as given in the following truth table:
a. List the minterms and and maxterms of each function. Show both
the algebraic and shorthand versions.
b. List the minterms of E’ and F’. Show both the algebraic and
shorthand versions.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentDigital Logic Homework
University of Information Technology

Computer Engineering Faculty
Page 2
c. List the minterms of E+F and EF. Show both the algebraic and
shorthand versions.
d. Express E and F in sumofminterms algebraic form.
e. Simplify E and F to expressions in SOP form. (Using a Kmap is
fine).
3. Simplify each of the following Boolean Functions into a SOP and POS
This is the end of the preview.
Sign up
to
access the rest of the document.
 Spring '11
 KHAI
 Boolean Algebra, 17

Click to edit the document details