Scribd
Upload
1K views

Solution CH 02 Part 1

This document contains solutions to problems from Chapter 2 on Boolean algebra and logic gates. Problem 2-1 involves using truth tables to demonstrate DeMorgan's theorem for three variables and the distributive law. Problem 2-4 reduces Boolean expressions to a given number of literals using algebraic techniques. Problem 2-5 finds the complement of a Boolean expression F and shows that F+F'=1. Problem 2-8 lists the truth table of a Boolean function. Problems 2-10 and 2-15 involve drawing logic diagrams and simplifying Boolean expressions.

Uploaded by

Srinivas Cheruku
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
1K views

Solution CH 02 Part 1

This document contains solutions to problems from Chapter 2 on Boolean algebra and logic gates. Problem 2-1 involves using truth tables to demonstrate DeMorgan's theorem for three variables and the distributive law. Problem 2-4 reduces Boolean expressions to a given number of literals using algebraic techniques. Problem 2-5 finds the complement of a Boolean expression F and shows that F+F'=1. Problem 2-8 lists the truth table of a Boolean function. Problems 2-10 and 2-15 involve drawing logic diagrams and simplifying Boolean expressions.

Uploaded by

Srinivas Cheruku
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 6

Chapter 2: Boolean Algebra & Logic Gates Solutions to Problems: [1, 4, 5, 8, 10, 15]

Problem: 2-1 Demonstrate by means of truth tables the validity of the following identities: (a) DeMorgans theorem for three variables: (x+y+z) = xyz and (xyz)=x+y+z (b) The distributive law: x+yz = (x+y)(x+z) Solution: (a) x 0 0 0 0 1 1 1 1 x 0 0 0 0 1 1 1 1 (b) x 0 0 0 0 1 1 1 1 y 0 0 1 1 0 0 1 1 z 0 1 0 1 0 1 0 1 yz 0 0 0 1 0 0 0 1 x+yz 0 0 0 1 1 1 1 1 x+y 0 0 1 1 1 1 1 1 x+z 0 1 0 1 1 1 1 1 (x+y)(x+z) 0 0 0 1 1 1 1 1 y 0 0 1 1 0 0 1 1 y 0 0 1 1 0 0 1 1 z 0 1 0 1 0 1 0 1 z 0 1 0 1 0 1 0 1 x+y+z 0 1 1 1 1 1 1 1 xyz 0 0 0 0 0 0 0 1 (x+y+z) 1 0 0 0 0 0 0 0 (xyz) 1 1 1 1 1 1 1 0 x 1 1 1 1 0 0 0 0 x 1 1 1 1 0 0 0 0 y 1 1 0 0 1 1 0 0 y 1 1 0 0 1 1 0 0 z 1 0 1 0 1 0 1 0 z 1 0 1 0 1 0 1 0 xyz 1 0 0 0 0 0 0 0 x+y+z 1 1 1 1 1 1 1 0

Page 1 of 6

Problem: 2-4 Reduce the following Boolean expressions to the indicated number of literals: (a) AC + ABC + AC to three literals (b) (xy+z) + z + xy + wz to three literals (c) AB(D+CD) + B(A+ACD) to one literal (d) (A+C)(A+C)(A+B+CD) to four literals Solution: (a) AC + ABC + AC = = = = = = AC + AC + ABC C(A+ A) + ABC C1 + ABC C + ABC (C+ AB)(C+C) AB + C

[distributive]

(b) (xy+z) + z + xy + wz

= = = =

(xy+z) + z + wz + xy (xy+z) + z(1+ w) + xy (xy+z) + z + xy (x + y)z + z + xy [DeMorgan] = (z + (x + y)) (z + z) + xy [distributive] = (z + (x + y)) 1 + xy = x + y + z + xy =x+y+z [absorption]

(c) AB(D + CD) + B(A+ACD) = = = = = = =

ABD + ABCD + AB+ ABCD ABD(C+C)+ ABD+ AB ABD+ ABD+ AB AB(D+D)+ AB AB+ AB B(A+ A) B

(d) (A+C)(A+C)(A+B+CD)

= = = = = =

(A+C)(A+C)(A+B+CD) (A + CC)(A + B + CD) A(A + B + CD) AA + AB + ACD AB + ACD A(B + CD)

Page 2 of 6

Problem 2-5: Find the complement of F = x + yz ; then show that Solution: F = x + yz

FF = 0

and

F + F = 1

The dual of F is: x ( y + z )

Complement each literal: x ( y + z ) = F

FF = ( x + yz ) ( x ( y + z ) ) = ( xx + xyz ) ( y + z ) = xyz ( y + z ) = xyy z + xyzz = 0


F + F = ( x + yz ) + ( x ( y + z ) ) = ( x + yz + x ) + ( x + yz + y + z ) = (1 + yz ) + ( x + yz + y + z ) = 1 + ( x + yz + y + z ) = 1
F = xy + xy + y z

Problem 2-8:

List the truth table of the function:

Solution: The truth table is: x 0 0 0 0 1 1 1 1 y 0 0 1 1 0 0 1 1 Z 0 1 0 1 0 1 0 1 F 0 1 0 0 1 1 1 1

Page 3 of 6

Problem 2-10: Draw the logical diagrams for the following Boolean expressions: (a) Y=AB+B(A+C).

(b)Y=BC+AC.

(c) Y=A+CD.

(d)Y=(A+B)(C+D).

Page 4 of 6

Problem 2-15 Given the Boolean function F=xyz+xyz+wxy+wxy+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 literals 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). Solutions: (a) The truth table of the function: X Y z 0 0 0 0 0 0 0 0 1 0 0 1 0 1 0 0 1 0 0 1 1 0 1 1 1 0 0 1 0 0 1 0 1 1 0 1 1 1 0 1 1 0 1 1 1 1 1 1 (b) The logic diagram:

w 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1

F 0 0 1 1 0 1 0 1 0 0 1 1 1 1 1 1

F(simplified) 0 0 1 1 0 1 0 1 0 0 1 1 1 1 1 1

(c) The simplified function: F =XYZ+XYZ+ WXY + WXY+ WXY =YZ (X+X) +XY (W+W) + WXY =YZ+ XY+ WXY

Page 5 of 6

(d) The truth table of the simplified function has been added in the truth table of (a) as F(simplified) (e) Logic circuit for simplified function

For 1st design there are 5 AND gates with 3 inputs and 1 OR gate with 5 inputs. For 2nd design there are 2 AND gates with 2 inputs and 1 OR gate with 3 inputs and 1 AND gate with 3 inputs.

Page 6 of 6

You might also like