LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e T 2-1 TABLE 2-1 Truth Tables for the Three Basic Logical Operations AND OR NOT X Y X Y X 0 0 0 0 0 0 0 1 0 1 0 0 1 1 1 0 1 0 0 1 0 1 1 1 1 1 1 1 Z X Y = Z X Y + = Z X = 2004 Pearson Education, Inc. M. Morris Mano & Charles R. Kime LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e 2-1 (b) Timing diagram X 0 0 1 1 Y 0 1 0 1 X Y (AND) 0 0 0 1 X Y (OR) 0 1 1 1 (NOT) X 1 1 0 0 (a) Graphic symbols OR gate X Y Z X Y X Y Z X Y AND gate X Z X NOT gate or inverter 2004 Pearson Education, Inc. M. Morris Mano & Charles R. Kime LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e 2-2 A B C F ABC (a) Three-input AND gate (b) Six-input OR gate A B C G A B C D E F D E F 2004 Pearson Education, Inc. M. Morris Mano & Charles R. Kime LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e T 2-2 TABLE 2-2 Truth Table for the Function F = X + Z X Y Z F 0 0 0 0 1 1 1 1 0 0 1 1 0 0 1 1 0 1 0 1 0 1 0 1 0 1 0 0 1 1 1 1 Y 2004 Pearson Education, Inc. M. Morris Mano & Charles R. Kime LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e 2-3 X Y Z F 2004 Pearson Education, Inc. M. Morris Mano & Charles R. Kime LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e T 2-3 TABLE 2-3 Basic Identities of Boolean Algebra 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. Commutative 12. 13. Associative 14. 15. Distributive 16. 17. DeMorgans X 0 + X = X 1 X = X 1 + 1 = X 0 0 = X X + X = X X X = X X + 1 = X X 0 = X X = X Y + Y X + = XY YX = X Y Z + ( ) + X Y + ( ) Z + = X YZ ( ) XY ( )Z = X Y Z + ( ) XY XZ + = X YZ + X Y + ( ) X Z + ( ) = X Y + X Y = X Y X Y + = 2004 Pearson Education, Inc. M. Morris Mano & Charles R. Kime LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e T 2-4 TABLE 2-4 Truth Tables to Verify DeMorgans Theorem A) X Y B) X Y 0 0 1 1 0 1 0 1 0 1 1 1 1 0 0 0 0 0 1 1 0 1 0 1 1 1 0 0 1 0 1 0 1 0 0 0 X Y + X Y + X Y X Y 2004 Pearson Education, Inc. M. Morris Mano & Charles R. Kime LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e 2-4 X Y Z F (a) F XYZ XYZ XZ (b) F XY XZ X Y F Z 2004 Pearson Education, Inc. M. Morris Mano & Charles R. Kime LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e T 2-5 TABLE 2-5 Truth Table for Boolean Function X Y Z (a) F (b) F 0 0 0 0 1 1 1 1 0 0 1 1 0 0 1 1 0 1 0 1 0 1 0 1 0 0 1 1 0 1 0 1 0 0 1 1 0 1 0 1 2004 Pearson Education, Inc. M. Morris Mano & Charles R. Kime LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e T 2-6 TABLE 2-6 Minterms for Three Variables X Y Z Product Term Symbol m 0 m 1 m 2 m 3 m 4 m 5 m 6 m 7 0 0 0 0 1 1 1 1 0 0 1 1 0 0 1 1 0 1 0 1 0 1 0 1 m 0 m 1 m 2 m 3 m 4 m 5 m 6 m 7 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 XYZ XYZ XYZ XYZ XYZ XYZ XYZ XYZ 2004 Pearson Education, Inc. M. Morris Mano & Charles R. Kime LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e T 2-7 TABLE 2-7 Maxterms for Three Variables X Y Z Sum Term Symbol M 0 M 1 M 2 M 3 M 4 M 5 M 6 M 7 0 0 0 0 1 1 1 1 0 0 1 1 0 0 1 1 0 1 0 1 0 1 0 1 M 0 M 1 M 2 M 3 M 4 M 5 M 6 M 7 0 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 0 X Y Z + + X Y Z + + X Y Z + + X Y Z + + X Y Z + + X Y Z + + X Y Z + + X Y Z + + 2004 Pearson Education, Inc. M. Morris Mano & Charles R. Kime LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e T 2-8 TABLE 2-8 Boolean Functions of Three Variables (a) X Y Z F (b) X Y Z E 0 0 0 0 1 1 1 1 0 0 1 1 0 0 1 1 0 1 0 1 0 1 0 1 1 0 1 0 0 1 0 1 0 1 0 1 1 0 1 0 0 0 0 0 1 1 1 1 0 0 1 1 0 0 1 1 0 1 0 1 0 1 0 1 1 1 1 0 1 1 0 0 F 2004 Pearson Education, Inc. M. Morris Mano & Charles R. Kime LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e 2-5 Y X Y X Y F Z 2004 Pearson Education, Inc. M. Morris Mano & Charles R. Kime LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e 2-6 (a) AB C(D E) A B C D E (b) AB CD CE A B C D C E 2004 Pearson Education, Inc. M. Morris Mano & Charles R. Kime LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e 2-7 X Z X Y Z Y F 2004 Pearson Education, Inc. M. Morris Mano & Charles R. Kime LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e 2-8 (a) m 0 m 1 m 2 m 3 (b) 0 1 0 1 Y X X Y X Y X Y X Y 2004 Pearson Education, Inc. M. Morris Mano & Charles R. Kime LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e 2-9 (a) XY 0 1 1 0 1 Y X (b) X Y 0 1 1 0 1 Y X 1 1 1 2004 Pearson Education, Inc. M. Morris Mano & Charles R. Kime LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e 2-10 (a) m 0 m 1 m 3 m 2 m 4 m 5 m 7 m 6 (b) YZ X 0 00 01 Y X Z 11 10 Y 1 X Z XYZ Z XY YZ X Y X Z XYZ Y X Z Y X Z 2004 Pearson Education, Inc. M. Morris Mano & Charles R. Kime LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e 2-11 0 1 Y Z X 1 00 01 11 10 1 1 YZ X XY XY 1 2004 Pearson Education, Inc. M. Morris Mano & Charles R. Kime LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e 2-12 0 1 Y Z X (a) 0 4 00 01 11 10 5 2 YZ X 1 3 7 6 Z 0 6 4 1 3 5 7 2 (b) X Z X 2004 Pearson Education, Inc. M. Morris Mano & Charles R. Kime LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e 2-13 0 1 Y Z X (a) 1 1 00 01 11 10 1 YZ X 1 Z Z 0 1 Y Z X (b) 1 00 01 11 10 1 YZ X 1 1 1 1 Y X 2004 Pearson Education, Inc. M. Morris Mano & Charles R. Kime LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e 2-14 0 1 Y Z X 1 00 01 11 10 1 YZ X 1 1 (a) F 1 (X, Y, Z) m(3, 4, 6, 7) YZ + XZ 0 1 Y Z X 00 01 11 10 1 YZ X 1 1 1 1 (b) F 2 (X, Y, Z) m(0, 2, 4, 5, 6) Z + XY 2004 Pearson Education, Inc. M. Morris Mano & Charles R. Kime LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e 2-15 0 1 Y Z X 1 00 01 11 10 YZ X 1 1 1 1 2004 Pearson Education, Inc. M. Morris Mano & Charles R. Kime LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e 2-16 0 1 Y Z X 00 01 11 10 1 YZ X 1 1 1 1 2004 Pearson Education, Inc. M. Morris Mano & Charles R. Kime LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e 2-17 (a) m 0 m 1 m 4 m 5 m 3 m 2 m 7 m 6 m 12 m 13 m 8 m 9 m 15 m 14 m 11 m 10 (b) 00 01 00 01 YZ WX Y Z W 11 10 11 10 X 2004 Pearson Education, Inc. M. Morris Mano & Charles R. Kime LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e 2-18 X Z 0 2 8 10 1 3 9 11 (b) (a) 00 01 00 01 YZ WX Y Z W 11 10 11 10 X 0 1 3 2 4 5 7 6 8 9 10 11 12 13 14 15 X Z 2004 Pearson Education, Inc. M. Morris Mano & Charles R. Kime LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e 2-19 00 01 00 01 YZ WX Y Z W 11 10 11 10 X 1 1 1 1 1 1 1 1 1 1 1 2004 Pearson Education, Inc. M. Morris Mano & Charles R. Kime LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e 2-20 00 01 00 01 CD AB C D A 11 10 11 10 B 1 1 1 1 1 1 1 2004 Pearson Education, Inc. M. Morris Mano & Charles R. Kime LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e 2-21 00 01 00 01 CD AB C D A 11 10 11 10 B 1 1 1 1 1 1 1 1 2004 Pearson Education, Inc. M. Morris Mano & Charles R. Kime LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e 2-22 00 01 00 01 CD AB C D A 11 10 11 10 B 1 1 1 1 1 1 1 (a) Plotting the minterms 00 01 00 01 CD AB C D A 11 10 11 10 B 1 1 1 1 1 1 1 (b) Essential prime implicants 2004 Pearson Education, Inc. M. Morris Mano & Charles R. Kime LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e 2-23 1 2 3 00 01 00 01 CD AB C D A 11 10 11 10 B 1 1 1 1 1 1 1 1 1 2004 Pearson Education, Inc. M. Morris Mano & Charles R. Kime LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e 2-24 00 01 00 01 CD AB C D A 11 10 11 10 B 1 0 1 1 1 0 0 0 0 0 0 0 1 0 1 1 2004 Pearson Education, Inc. M. Morris Mano & Charles R. Kime LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e 2-25 00 01 00 01 CD AB C D A 11 10 11 10 B X X 1 1 0 X 1 0 0 0 0 1 0 0 0 1 (a) F CD A B (b) F CD AD CD AB X 00 01 00 01 C D A 11 10 11 10 B 1 1 X 0 X 1 0 0 0 1 0 0 1 0 0 2004 Pearson Education, Inc. M. Morris Mano & Charles R. Kime LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e 2-26 A G B E C D F (a) A B C E G D F (b) A B C G E D F (c) G A B F E C D (d) 2004 Pearson Education, Inc. M. Morris Mano & Charles R. Kime LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e 2-27 A B C D E F H G (a) C D E F A B G H (b) C D E F A B G H (c) 2004 Pearson Education, Inc. M. Morris Mano & Charles R. Kime LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e 2-28 Graphics Symbols Name Distinctive shape Algebraic equation Truth table AND F XY OR F X Y Buffer F X NAND F X Y F X Y NOR 3-State Buffer X 0 0 1 1 Y 0 1 0 1 F 0 0 0 1 X 0 0 1 1 Y 0 1 0 1 F 1 1 1 0 X 0 0 1 1 Y 0 1 0 1 F 1 0 0 0 X 0 0 1 1 Y 0 1 0 1 F 0 1 1 1 X 0 1 F 0 1 F X Y F X Y F X Y NOT (inverter) F X X 0 1 F 1 0 F X E F X F X X Y F E 0 0 1 1 X 0 1 0 1 F Hi-Z Hi-Z 0 1 2004 Pearson Education, Inc. M. Morris Mano & Charles R. Kime LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e 2-29 Graphics Symbols Name Distinctive shape symbol Algebraic equation Truth table X Y F ExclusiveOR (XOR) F XY XY X Y AND-OR-INVERT (AOI) OR-AND -INVERT (OAI) AND-OR (AO) OR-AND (OA) F W X Y Z F W X Y Z F WX YZ F WX YZ F (W X )(Y Z) F (W X )(Y Z) X 0 0 1 1 Y 0 1 0 1 F 0 1 1 0 X 0 0 1 1 Y 0 1 0 1 F 1 0 0 1 ExclusiveNOR (XNOR) X Y F F XY XY X Y F W X Y Z F W X Y Z 2004 Pearson Education, Inc. M. Morris Mano & Charles R. Kime LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e 2-30 NOT X X X Y X OR X Y AND X XY XY XY X Y XY 2004 Pearson Education, Inc. M. Morris Mano & Charles R. Kime LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e 2-31 (b) A B C D 00 01 00 01 CD AB C D A 11 10 11 10 B 1 1 1 1 1 1 1 1 0 1 Y Z X (a) X Y Z 1 00 01 11 10 1 YZ X 1 1 2004 Pearson Education, Inc. M. Morris Mano & Charles R. Kime LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e 2-32 X Y Z C P (b) C X Y Z P (a) P X Y Z X Y Z P 2004 Pearson Education, Inc. M. Morris Mano & Charles R. Kime LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e 2-33 (b) Truth table EN IN OUT 0 1 1 X 0 1 Hi-Z 0 1 (a) Logic symbol IN EN OUT 2004 Pearson Education, Inc. M. Morris Mano & Charles R. Kime LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e 2-34 IN1 X X X 0 1 0 1 0 1 X IN0 0 1 X X 0 1 1 0 OL EN1 0 (S) 0 0 1 1 1 1 1 1 Hi-Z 0 1 0 1 0 1 EN0 0 1 0 0 1 1 1 1 (S) 1 (b) Truth table (a) Logic Diagram IN0 EN0 IN1 EN1 (S) (S) OL 2004 Pearson Education, Inc. M. Morris Mano & Charles R. Kime LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e 2-35 (a) X Y TG C C (c) C 0 and C 1 X Y (b) X Y C 1 and C 0 (d) X Y C TG 2004 Pearson Education, Inc. M. Morris Mano & Charles R. Kime LOGIC AND COMPUTER DESIGN FUNDAMENTALS, 3e 2-36 (b) A 0 0 1 1 C 0 1 0 1 TG1 No path Path No path Path TG0 Path No path Path No path F 0 1 1 0 (a) C A F TG0 TG1
Analysis and Computation of Fixed Points: Proceedings of a Symposium Conducted by the Mathematics Research Center, the University of Wisconsin—Madison, May 7-8, 1979
Here are the answers to the evaluation:1. Well-defined set2. Universal set 3. Empty set4. Equivalent sets5. Venn diagram6. Roster method8. Equal sets 9. Disjoint sets10. Descriptive method