Scribd
Upload
20 views3 pages

TD2 2

Uploaded by

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

TD2 2

Uploaded by

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

TD2 : Boolean Algebra and Logic Gates

Ex1. Demonstrate the validity of the following identities by means of truth tables:
(a) DeMorgan’s theorem for three variables:
(𝑥 + 𝑦 + 𝑧)’ = 𝑥’𝑦’𝑧’ and (𝑥𝑦𝑧)’ = (𝑥’ + 𝑦’ + 𝑧’)
(b) The distributive law: 𝑥 + 𝑦𝑧 = (𝑥 + 𝑦)(𝑥 + 𝑧)
(c) The distributive law: 𝑥(𝑦 + 𝑧) = 𝑥𝑦 + 𝑥𝑧
(d) The associative law: 𝑥 + (𝑦 + 𝑧) = (𝑥 + 𝑦) + 𝑧
(e) The associative law and 𝑥(𝑦𝑧) = (𝑥𝑦)𝑧
Ex2. Simplify the following Boolean expressions to a minimum number of literals:
(a) 𝑥𝑦 + 𝑥𝑦’ (b) (𝑥 + 𝑦)(𝑥 + 𝑦’)
(c) 𝑥𝑦𝑧 + 𝑥’𝑦 + 𝑥𝑦𝑧’ (d) (𝐴 + 𝐵)’(𝐴 + 𝐵)’
(e) 𝑥𝑦 + 𝑥(𝑤𝑧 + 𝑤𝑧 ) (f) (𝐵𝐶 + 𝐴 𝐷)(𝐴𝐵 + 𝐶𝐷 )
Draw logic diagrams of the circuits that implement the original and simplified
expressions. (b) and (f)
Ex3. Reduce the following Boolean expressions to the indicated number of literals:

(a) 𝐴’𝐶’ + 𝐴𝐵𝐶 + 𝐴𝐶’ to three literals


(b) (𝑥’𝑦’ + 𝑧)’ + 𝑧 + 𝑥𝑦 + 𝑤𝑧 to three literals
(c) 𝐴’𝐵(𝐷’ + 𝐶’𝐷) + 𝐵(𝐴 + 𝐴’𝐶𝐷) to one literal

Draw logic diagrams of the circuits that implement the original and simplified
expressions. (a) and (b)
Ex4. Find the complement of 𝐹 = 𝑤𝑥 + 𝑦𝑧; then show that 𝐹𝐹′ = 0 and 𝐹 + 𝐹′ = 1.

Find the complement of the following expressions:

(a). 𝑥𝑦’ + 𝑥’𝑦 (b). (𝑎 + 𝑐)(𝑎 + 𝑏’)(𝑎’ + 𝑏 + 𝑐’)

(c). 𝑧 + 𝑧’(𝑣’𝑤 + 𝑥𝑦)

Ex5. We can perform logical operations on strings of bits by considering each pair of corresponding
bits separately (called bitwise operation). Given two eight‐bit strings A = 10110001 and B = 10101100,
evaluate the eight‐bit result after the following logical operations:

(a). AND (b). OR (c). NOT A (c). XOR

List the truth table of the function:

(a). 𝐹 = 𝑥𝑦 + 𝑥𝑦 + 𝑦′𝑧 (b). 𝐹 = 𝑏𝑐 + 𝑎′𝑐′

Ex6. Draw logic diagrams to implement the following Boolean expressions:

(a) 𝐹 = [(𝑢 + 𝑥’)(𝑦’ + 𝑧)] (b) 𝐹 = (𝑢⨁𝑦) + 𝑥

(c) 𝐹 = 𝑢(𝑥⨁𝑧) + 𝑦′ (d) 𝐹 = (𝑥 + 𝑦 )(𝑥𝑦 + 𝑥′𝑦′)


Ex7. Simplify the following Boolean functions T1 and T2 to a minimum number of literals:

A B C T1 T2
0 0 0 1 0
0 0 1 1 0
0 1 0 1 0
0 1 1 0 1
1 0 0 0 1
1 0 1 0 1
1 1 0 0 1
1 1 1 0 1

Ex8. For the Boolean function


𝐹 = 𝑥𝑦 𝑧 + 𝑥 𝑦 𝑧 + 𝑤 𝑥𝑦 + 𝑤𝑥 𝑦 + 𝑤𝑥𝑦
(a) Obtain the truth table of F.
(b) Draw the logic diagram, using the original Boolean expression.
(c) Use Boolean algebra to simplify the function to a minimum number of literals.
(d) Obtain the truth table of the function from the simplified expression and show that it is
the same as the one in part (a).
(e) Draw the logic diagram from the simplified expression, and compare the total number
of gates with the diagram of part (b).
Ex9. Express the following function as a sum of minterms and as a product of maxterms:
𝐹 (𝐴, 𝐵, 𝐶, 𝐷) = 𝐵 𝐷 + 𝐴 𝐷 + 𝐵𝐷
Ex10. Express the complement of the following functions in sum‐of‐minterms form:
(a) 𝐹 (𝐴, 𝐵, 𝐶, 𝐷) = ∑(2,4,7,10,12,14)
(b) 𝐹 (𝑥, 𝑦, 𝑧) = ∑(3,5,7)
Ex11. Convert each of the following expressions into sum of products and product of sums:
(a) (𝑢 + 𝑥𝑤)(𝑥 + 𝑢 𝑣)
(b) 𝑥 + 𝑥(𝑥 + 𝑦 )(𝑦 + 𝑧 )
Ex12. Write Boolean expressions and construct the truth tables describing the outputs of the circuits
described by the logic diagrams below.
Ex13. Let us consider the logic functions represented in diagram below

(a). Determine the logic expressions for the outputs F.


(b). Express the logic function F as a sum of products.
Ex14. Let us consider the logic functions represented in diagram below

(a). Determine the logic expressions for the outputs G.


(b). Give the product-of-sums form of G.
Ex15. Let us consider the following expression:
(a). Write the following Boolean expressions in sum of products form: (𝑏 + 𝑑)(𝑎 + 𝑏 + 𝑐 )
(b). Write the following Boolean expression in product of sums form: 𝑎 𝑏 + 𝑎 𝑐 + 𝑎𝑏𝑐

You might also like