Scribd
Upload
82 views

Digital Logic Design Assignment

The document provides instructions for 11 assignments involving Boolean algebra and digital logic concepts including: 1) Using truth tables to prove DeMorgan's theorem and the distributive law. 2) Reducing Boolean expressions to a specified number of literals. 3) Drawing logic diagrams and truth tables for Boolean expressions. 4) Converting between sum of products and product of sums canonical forms. 5) Simplifying Boolean expressions algebraically and implementing with logic gates.

Uploaded by

Salih Anwar
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
82 views

Digital Logic Design Assignment

The document provides instructions for 11 assignments involving Boolean algebra and digital logic concepts including: 1) Using truth tables to prove DeMorgan's theorem and the distributive law. 2) Reducing Boolean expressions to a specified number of literals. 3) Drawing logic diagrams and truth tables for Boolean expressions. 4) Converting between sum of products and product of sums canonical forms. 5) Simplifying Boolean expressions algebraically and implementing with logic gates.

Uploaded by

Salih Anwar
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Asignment two (digital logic)

1. Demonstrate by means of truth tables the validity of the following identities:

a. DeMorgan’s theorem for three variables: (x+y+z)’ = x’y’z’ and (xyz)’=x’+y’+z’

b. The distributive law: x+yz = (x+y)(x+z)

2. Reduce the following Boolean expressions to the indicated number of literals:

a. A’C’ + ABC + AC’ to three literals

b. (x’y’+z)’ + z + xy + wz to three literals

c. A’B(D’+C’D) + B(A+A’CD) to one literal

d. (A’+C)(A’+C’)(A+B+C’D) to four literals

3. List the truth table of the function:


' '
F=xy + x y + y z

4. Draw the logical diagrams for the following Boolean expressions:


a. Y=A’B’+B(A+C).
b. Y=BC+AC’.
c. Y=A+CD.
d. Y=(A+B)(C’+D).
5. Given the Boolean function F=xy’z+x’y’z+w’xy+wx’y+wxy.

a. Obtain the truth table of the function.

b. Draw the logical diagram using the original Boolean expression.

c. Simplify the function to a minimum number of laterals using Boolean algebra.

d. Obtain the truth table of the function using the simplified expression.

e. Draw the logical diagram from the simplified expression and compare the total
number of gates with the diagram of part (b).

6. Convert the following to the other canonical form:

(a) F (x, y , z) = ∑ (1,3,7) (b) F(A,B,C,D)= ∏ (0,1,2,3,4,6,12)


7. Simplify the Boolean function F (x, y , z) )= ∏ (1,3,6,7) in sum of products using
algebraic manipulation and implement it
a. With AND and inverter gates
b. With OR and inverter gates

8. Given the Boolean expression F = x’y + xyz’

i. Derive an algebraic expression for the complement F’.

ii. Show that F·F’ = 0.

9. Given the Boolean function F = xy’z + x’y’z + xyz


a. List the truth table
b. ii. Simplify the function using Boolean algebra
c. iii. List the truth table of the simplified function

10. Simplify the following Boolean function F(x,y,z) = x’y’z’ + x’y + xyz’ +xz to a
minimum number of literals using algebraic manipulation and implement
a. With AND and inverter gates
b. With OR and inverter gates
11. The function F(A,B,C,D) = A’BCD’ + AB’C’+ BCD’ +ACD
i. Construct a truth table for the function given above.
ii. Use the truth table of to write the function F in sum of minterms
iii. Use the truth table of To write the function F in product of maxterms.

You might also like