Scribd
Upload
30 views3 pages

DLD Assignment Solutions

Uploaded by

bitf24m043
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
30 views3 pages

DLD Assignment Solutions

Uploaded by

bitf24m043
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Digital Logic Design - Assignment #2

Solutions
Question 1: Boolean Expression Simplification

a) Simplify (A' + C)(A' + C')(A + B + C'D)


1. Apply distribution on the first two terms:
(A' + C)(A' + C') = A'
2. Now simplify with the third term:
A'(A + B + C'D) = A' (since A'A = 0)
Final simplified expression: A'

b) Simplify z(w + x)' + w' x z + w x y z' + w x' y z'


1. Apply DeMorgan’s law on (w + x)':
(w + x)' = w' x'
Substitute:
z w' x' + w' x z + w x y z' + w x' y z'
2. Combine like terms:
z w' x' + w' x z = w' x (z + z') = w' x
w x' y z' + w x y z' = w z' (x' y + x y) = w z'
Final simplified expression: w' x + w z'

c) Simplify y'(x'z' + xz) + z(x + y)'


1. Use the Distributive property on the first part:
y'(x' z' + x z) = y'
2. Apply DeMorgan’s law to (x + y)':
z(x' y') = z x' y'
Final simplified expression: y' + z x' y'

d) Simplify (x' y' + z)' + z + xy + wz


1. Apply DeMorgan’s law:
(x' y' + z)' = x y z'
2. Combine with the other terms:
x y z' + z + x y + w z
Final simplified expression: z + x y + w z

e) Simplify xy' z + x(y + z')' + xy' z'


1. Simplify (y + z')' using DeMorgan’s law:
(y + z')' = y' z
2. Combine like terms:
x y' z + x y' z + x y' z' = x y' (z + z') = x y'
Final simplified expression: x y'

Question 2: Boolean Function Operations

a) Truth Table for F(w, x, y, z)


|w|x|y|z|F|
|---|---|---|---|---|
|0|0|0|0|1|
|0|0|0|1|1|
|0|0|1|0|0|
|0|0|1|1|1|
|0|1|0|0|1|
|0|1|0|1|1|
|0|1|1|0|0|
|0|1|1|1|1|
|1|0|0|0|1|
|1|0|0|1|1|
|1|0|1|0|1|
|1|0|1|1|1|
|1|1|0|0|1|
|1|1|0|1|1|
|1|1|1|0|1|
|1|1|1|1|1|

b) Logic Diagram (unsimplified)


This part would involve drawing the logic diagram for F(w, x, y, z).

c) Canonical Forms
Sum of Minterms: F = m_0 + m_1 + m_3 + m_4 + m_5 + m_7 + m_8 + m_10 + m_11 + m_12 +
m_13 + m_14 + m_15
Product of Maxterms: F = M_2 M_6 M_9

d) Simplified Expression
From previous simplification:
F=z+xy+wz

e) Truth Table Comparison


The truth table for the simplified expression will match that of the unsimplified form.

f) Logic Diagram (Simplified)


The simplified expression can be implemented using fewer gates, reducing overall
complexity.
Question 3: Boolean Function Analysis

a) Truth Table for F


|w|x|y|z|F|
|---|---|---|---|---|
|0|0|0|0|0|
|0|0|0|1|0|
|0|0|1|0|0|
|0|0|1|1|1|
|0|1|0|0|0|
|0|1|0|1|0|
|0|1|1|0|1|
|0|1|1|1|1|
|1|0|0|0|0|
|1|0|0|1|0|
|1|0|1|0|1|
|1|0|1|1|1|
|1|1|0|0|0|
|1|1|0|1|1|
|1|1|1|0|1|
|1|1|1|1|1|

b) Logic Diagram
The logic diagram will be based on the Boolean expression provided.

c) Simplified Function
The simplified expression for the function is:
F = z + xy

d) Logic Diagram (NAND gates)


The simplified expression F = z + xy can be implemented using only NAND gates.

e) Truth Table Comparison


The truth table for the simplified expression matches the one in part a.

You might also like