Homework Solution #1. Chapter 2 2.6, 2.17, 2.24, 2.30, 2.39, 2.42, Grading policy is as follows: - Total 100
|
|
- Jerome Bennett
- 5 years ago
- Views:
Transcription
1 Homework Solution #1 Chapter 2 2.6, 2.17, 2.24, 2.30, 2.39, 2.42, 2.48 Grading policy is as follows: - Total 100 Exercise 2.6 (total 10) - Column 3 : 5 point - Column 4 : 5 point Exercise 2.17 (total 25) - a), d), g) : 5 point - others : 2 point each Exercise 2.24 (total 15) - each of sub-item : 2.5 point Exercise 2.30 (total 10) - Each one functional table has 5 point Exercise 2.39 (total 10) - minterm/maxterm expression has 5 point each Exercise 2.42 (total 10) - a), b) has 5 point each Exercise 2.48 (total 20) - a), b), c) : 5 point each - One set result has 5 point
2 2 Solutions Manual - Introduction to Digital Design - February 3, 1999 A tabular representation would not be practical because there are 4 4 = 16 variables, each of which can have 4values, resulting in a table of 4 16 rows. Exercise 2.5 Inputs: Integer 0 x<2 16, binary control variable d 2f0; 1g Output: ( Integer 0 z<2 16. (x +1)mod2 16 if d =1 z = (x, 1) mod 2 16 if d =0 Tabular representation: Requires 2 16 rows for d = 1 and 2 16 rows for d =0. Total rows= =2 17. A tabular representation is out of question. Exercise 2.6 a b f 1 (a; b) f 2 (b; f 1 (a; b)) Exercise 2.7 Range from 10 to 25 ) 16 values. Minimum number of binary variables: dlog 2 16e =4variables. Input: integer 10 x 25 Output: integer 0 z 15 z =(x, 10) In the next table the output z is represented by avector z =(z 3 ;z 2 ;z 1 ;z 0 ), with z i 2f0; 1g. x z Exercise 2.8 (a) Month: dlog 2 12e = 4 bits Month Jan Feb Mar Apr May Jun Jul Aug Sep Oct Nov Dec Code (b) Day: dlog 2 31e = 5 bits Year (assuming ): dlog e = 12 bits Month: 4 bits A total of 21 bits would be needed. (c) Each decimal digit needs 4 bits. Two digits are necessary to represent the day, and 4 digits to represent the year. The number of bits to represent these elds would be 6 4 = 24 bits. Adding
3 Solutions Manual - Introduction to Digital Design - February 3, (b) Prove that f NAND (f NAND (x 1;x 0 );f NAND (x 1;x 0 )) = f AND (x 1;x 0 ) x 1 x 0 f NAND (x 1 ;x 0 ) f NAND (f NAND (x 1 ;x 0 );f NAND (x 1 ;x 0 )) f AND (x 1 ;x 0 ) The conclusion is: f NAND (f NAND (x 1;x 0 );f NAND (x 1;x 0 )) = f AND (x 1;x 0 ) Exercise 2.16 Each variable can have 2values (0 or 1). Total number of n-variable inputs: 2 2{z ::: 2} =2 n n For each input, the output function can have 2values. Total number of functions: 2 2 ::: 2 {z } =2 2 n 2 n Exercise 2.17 a) Let f be a symmetric switching function of three variables, x; y; and z. Since the function is symmetric, f(0; 0; 1) = f(0; 1; 0) = f(1; 0; 0) and f(0; 1; 1) = f(1; 0; 1) = f(1; 1; 0) so that we have the following table: x y z f a b b c b c c d where a; b; c; and d are binary variables. From this description any particular example can be generated by assigning values to a; b; c, and d. b) Since a; b; c; and d can each take two values (0 or 1), the number of symmetric functions of three variables is 2 4 = 16. c) A symmetric switching function has the same value for all argument values that have the same number of 1's, since all these values can be obtained by permuting the arguments. Consequently, the values of the function of n arguments are decomposed into n + 1 classes dened by the number of 1's in the argument vector (four classes in part a). Therefore the set A completely denes the function. d) The function has value 1 whenever 0; 2 or 3 arguments have value 1. The table is
4 8 Solutions Manual - Introduction to Digital Design - February 3, 1999 w x y z f e) In part (c) we saw that the argument values of symmetric switching function of n variables are divided into n+1 classes. For each of these classes the function can have value 1 or 0. Consequently, the number of symmetric switching functions of n variables is 2 n+1. f) No, the composition of symmetric switching functions is not necessarily a symmetric function. Consider as counterexample f(x; y; z) =f AND (f OR (x; y);z) and interchange the variables x and z. g) The table is a b c f 1 f 2 f h) Let U be the set f0; 1;:::;ng where n is the number of variables of the symmetric function, and let A be the set describing the function f. Since the complement of f is 0 when f is 1 and viceversa, it is represented by the set A c such that A c = U, A For example, considering a 4-variable symmetrical function with A = f0; 1g, wehave A c = f2; 3; 4g. Exercise 2.18 (a) The threshold switching function of three variables with w 1 =1,w 2 =2,w 3 =,1, and T =2 is:
5 Solutions Manual - Introduction to Digital Design - February 3, z 8 = one set(5; 6); z 7 = one set(6; 7; 8); z 6 = one set(3; 9; 12; 17; 18; 20; 24); z 5 = one set(3; 5; 12; 18; 20; 24); z 4 = one set(5; 9; 18; 20; 24); z 3 = one set(5; 10); z 2 = one set(6; 12; 17; 24); z 1 = one set(3; 6; 9; 10; 12; 20); z 0 = one set(3; 17; 18); Exercise 2.23 The number of values of n binary variables is 2 n. For each of these, the function can take three possible values (0; 1 or dc) resulting in 3 2n functions. Out of these 2 2n are completely specied functions. Exercise 2.24 (a) a 0 b 0 + ab + a 0 b = a 0 (b + b 0 )+ab = a 0 1+ab = a 0 + b (b) a 0 + a(a 0 b + b 0 c) 0 = a 0 +(a 0 b + b 0 c) 0 = a 0 +(a + b 0 )(b + c 0 ) = a 0 + ab + ac 0 + bb 0 + b 0 c 0 = a 0 + b + c 0 + b 0 c 0 = a 0 + b + c 0
6 14 Solutions Manual - Introduction to Digital Design - February 3, 1999 (c) (a 0 b 0 + c)(a + b)(b 0 + ac) 0 = (a 0 b 0 + c)(a + b)b(a 0 + c 0 ) = (a 0 b 0 + c)b(a 0 + c 0 ) = (ba 0 b 0 + bc)(a 0 + c 0 ) = bc(a 0 + c 0 ) = a 0 bc (d) ab 0 + b 0 c 0 + a 0 c 0 = ab 0 +(a + a 0 )b 0 c 0 + a 0 c 0 = ab 0 + ab 0 c 0 + a 0 b 0 c 0 + a 0 c 0 = ab 0 (1 + c 0 )+a 0 (1 + b 0 )c 0 = ab 0 + a 0 c 0 (e) wxy + w 0 x(yz + yz 0 )+x 0 (zw + zy 0 )+z(x 0 w 0 + y 0 x) = wxy + w 0 xy + z(x 0 (w + y 0 )+x 0 w 0 + y 0 x) = (w + w 0 )xy + z(x 0 (w + y 0 + w 0 )+y 0 x) = xy + z(x 0 + xy 0 ) = xy + z(x 0 + y 0 ) = xy + z(xy) 0 = xy + z (f) abc 0 + bc 0 d + a 0 bd = abc 0 +(a + a 0 )bc 0 d + a 0 bd = abc 0 + abc 0 d + a 0 bc 0 d + a 0 bd = abc 0 (1 + d)+a 0 bd(1 + c 0 ) = abc 0 + a 0 bd Exercise 2.25 xz 0 + x 0 z = = x(xy 0 + x 0 y) 0 + x 0 (xy 0 + x 0 y) = x(xy 0 ) 0 (x 0 y) 0 + x 0 xy 0 + x 0 x 0 y = x(x 0 + y)(x + y 0 )+x 0 y = (xx 0 + xy)(x + y 0 )+x 0 y = (xyx + xyy 0 )+x 0 y = xy + x 0 y = (x + x 0 )y = 1 y
7 16 Solutions Manual - Introduction to Digital Design - February 3, 1999 abc a#(b&c) (a#b)&(a#c) 000 0#0 = 0 0&0 = #1 = 0 0&0 = #2 = 0 0&0 = #1 = 0 0&0 = #1 = 0 0&0 = #2 = 0 0&0 = #2 = 0 0&0 = #2 = 0 0&0 = #2 = 0 0&0 = #0 = 0 0&0 = #1 = 1 0&1 = #2 = 1 0&1 = #1 = 1 1&0 = #1 = 1 1&1 = #2 = 1 1&1 = #2 = 1 1&0 = #2 = 1 1&1 = #2 = 1 1&1 = #0 = 0 0&0 = #1 = 1 0&1 = #2 = 2 0&2 = #1 = 1 1&0 = #1 = 1 1&1 = #2 = 2 1&2 = #2 = 2 2&0 = #2 = 2 2&1 = #2 = 2 2&2 = 2 Table 2.2: Proof of distributivity for system in Exercise 2.29 (a) (#); (&) are commutative because the table is symmetric about the main diagonal, so postulate 1 (P 1) is satised. (b) For distributivity, we must show that a#(b&c) =(a#b)&(a#c). Let us prove that this postulate is true for the system by perfect induction, as shown in Table 2.2. (c) The additive identity element is 0 since a&0 = 0&a = a. The multiplicative identity element is 2 since a#2 = 2#a = a. (d) For1tohave a complement 1 0 we need 1&1 0 =2and 1#1 0 =0. Consequently, from the table we see that 1 has no complement. Exercise 2.30 Let us call the four elements 0;x;y, and 1 with 0 the additive identity, 1 the multiplicative identity and let x be the complement of y. The corresponding operation tables are
8 Solutions Manual - Introduction to Digital Design - February 3, x y x y 1 x x x 1 1 y y 1 y * 0 x y x 0 x 0 x y 0 0 y y 1 0 x y 1 Exercise 2.31 To show that the NAND operator is not associative, that means, ((a:b) 0 :c) 0 6= (a:(b:c) 0 ) 0 we just need to nd a case when the expressions are dierent. Take a = 0, b = 0 and c = 1. For these values we have: ((a:b) 0 :c) 0 = ((0:0) 0 :1) 0 =(1:1) 0 =0 (a:(b:c) 0 ) 0 =(0:(0:1) 0 ) 0 =1 So, the NAND operator is not associative. To show that the NOR operator is not associative, that means, ((a + b) 0 + c) 0 6=(a +(b + c) 0 ) 0 we take a =0,b = 0 and c =1. For these values we have: ((a + b) 0 + c) 0 = ((0 + 0) 0 +1) 0 =0 (a +(b + c) 0 ) 0 = (0 + (0 + 1) 0 ) 0 =(0+0) 0 =1 So, the NOR operator is not associative. Exercise 2.32 Part (a) (i) show that XOR operator is commutative: a b a b b a (ii) show that XOR operator is associative: a (b c) =(a b) c abc a b b c (a b) c a (b c)
9 Solutions Manual - Introduction to Digital Design - February 3, Exercise 2.37 Expr a Expr b Expr c Expr d Expr e x y z x 0 y 0 + xz + xz 0 xy + x 0 y 0 + yz 0 xyz + x 0 y 0 z + x 0 z 0 + xyz 0 y 0 z + x 0 z 0 + xyz x 0 y 0 + x 0 z 0 + xyz Equivalent expressions: Expr a and Expr d, Expr b and Expr c. Exercise 2.38 (a) E(a; b; c; d) =abc 0 d + ab 0 c + bc 0 d + ab 0 c 0 + acd + a 0 bcd E(a; b; c; d) = c 0 d(ab + b)+ab 0 (c + c 0 )+(a + a 0 b)cd = bc 0 d + ab 0 +(a + b)cd = bd(c + c 0 )+ab 0 + acd = bd + ab 0 + a(b + b 0 )cd = bd(1 + ac)+ab 0 (1 + cd) = ab 0 + bd (b) E(a; b; c; d) =acb + ac 0 d + bc 0 d + a 0 b 0 c 0 + ab 0 c 0 d 0 + bc 0 d E(a; b; c; d) = bc 0 (d + d 0 )+b 0 c 0 (a 0 + ad 0 )+acb + ac 0 d = bc 0 + b 0 c 0 a 0 + b 0 c 0 d 0 + acb + ac 0 d = c 0 (b + b 0 a 0 + b 0 d 0 + ad)+acb = c 0 (b + a 0 + d + d 0 )+acb = c 0 + acb = ab + c 0 Exercise 2.39 f = a 0 b 0 c + a 0 bc 0 + a 0 bc + ab 0 c = m 1 + m 2 + m 3 + m 5 = P m(1; 2; 3; 5) f =(a + b + c)(a 0 + b + c)(a 0 + b 0 + c)(a 0 + b 0 + c 0 )=M 0 + M 4 + M 6 + M 7 = Q M(0; 4; 6; 7) Exercise 2.40 (a) a 0 b + ac + bc = a 0 b(c + c 0 )+a(b + b 0 )c +(a + a 0 )bc = a 0 bc + a 0 bc 0 + abc + ab 0 c + abc + a 0 bc = m 3 + m 2 + m 7 + m 5 + m 7 + m 3 = X m(2; 3; 5; 7) = Y M(0; 1; 4; 6)
10 Solutions Manual - Introduction to Digital Design - February 3, Exercise 2.42 a) We rst convert to a sum of products [((a + b + a 0 c 0 )c + d) 0 + ab] 0 = = (((a + b + a 0 c 0 )c + d) 0 ) 0 (ab) 0 = ((a + b + a 0 c 0 )c + d)(a 0 + b 0 ) = (ac + bc + d)(a 0 + b 0 ) = a 0 bc + a 0 d + ab 0 c + b 0 d To get the CSP we expand and eliminate repeated minterms In m-notation, = a 0 bc(d + d 0 )+a 0 d(b + b 0 )(c + c 0 )+ab 0 c(d + d 0 )+b 0 d(a + a 0 )(c + c 0 ) = a 0 bcd + a 0 bcd 0 + a 0 bc 0 d + a 0 b 0 cd + a 0 b 0 c 0 d + ab 0 cd + ab 0 cd 0 + ab 0 c 0 d b) We rst get a sum of products E(a; b; c; d) = X m(1; 3; 5; 6; 7; 9; 10; 11) [(w 0 +(xy + xyz 0 +(x + z) 0 ) 0 )(z 0 + w 0 )] 0 = = (w 0 +(xy + xyz 0 + x 0 z 0 ) 0 ) 0 +(z 0 + w 0 ) 0 = (w(xy + xyz 0 + x 0 z 0 )+zw = wxy + wxyz 0 + wx 0 z 0 + wz Now we expand and eliminate repeated minterms In m-notation, = wxy(z + z 0 )+wxyz 0 + wx 0 z 0 (y + y 0 )wz(x + x 0 )(y + y 0 ) = wxyz + wxyz 0 + wx 0 yz 0 + wx 0 y 0 z 0 + wxy 0 z + wx 0 yz + wx 0 y 0 z E(w; x; y; z) = X m(8; 9; 10; 11; 13; 14; 15) Exercise 2.43 (a) E(w; x; y; z) =xyz + yw + x 0 z 0 + xy 0 E(w; x; y; z) = x(yz + y 0 )+yw + x 0 z 0 = x(y 0 + z)+yw + x 0 z 0 = (x(y 0 + z)+yw + x 0 )(x(y 0 + z)+yw + z 0 ) = (y 0 + z + yw + x 0 )(xy 0 + z 0 + xz + yw) = (w + x 0 + y 0 + z)(xy 0 + x + z 0 + yw) = (w + x 0 + y 0 + z)(x + z 0 + yw) = (w + x 0 + y 0 + z)(w + x + z 0 )(x + y + z 0 ) = (x + x 0 + y 0 + z)(w + x + y + z 0 )(w + x + y 0 + z 0 )(w 0 + x + y + z 0 )
11 Solutions Manual - Introduction to Digital Design - February 3, zero-set(z 1 )=f1; 2; 5; 6; 9; 10; 13; 14; 16; 19; 20; 23; 24; 27; 28; 31g zero-set(z 0 )=f1; 3; 5; 7; 9; 11; 13; 15; 17; 19; 21; 23; 25; 27; 19; 31g Exercise 2.48 (a) A high-level description is Input: x =(x 3 ;x 2 ;x 1 ;x 0 ), and x i 2f0; 1g Output: z 2f0; 1; 2; 3; 4g Function: z = 3X i=0 x i (b) the table for arithmetic function and (c) the table for the switching functions considering binary code for z are shown next: x 3 x 2 x 1 x 0 z x 3 x 2 x 1 x 0 z 2 z 1 z The one-sets that correspond to this table are: one-set(z 2 )=f15g one-set(z 1 )=f3; 5; 6; 7; 9; 10; 11; 12; 13; 14g one-set(z 0 )=f1; 2; 4; 7; 8; 11; 13; 14g Exercise 2.49 (a) Inputs: x; y where x; y 2f0; 1; 2; 3g Output: z 2f0; 1; 2; 3; 4; 6; 9g Function: z = x y (b) The table for the arithmetic function is
Homework 1/Solutions. Graded Exercises
MTH 310-3 Abstract Algebra I and Number Theory S18 Homework 1/Solutions Graded Exercises Exercise 1. Below are parts of the addition table and parts of the multiplication table of a ring. Complete both
More informationMC9211 Computer Organization
MC92 Computer Organization Unit : Digital Fundamentals Lesson2 : Boolean Algebra and Simplification (KSB) (MCA) (29-2/ODD) (29 - / A&B) Coverage Lesson2 Introduces the basic postulates of Boolean Algebra
More informationCHAPTER 3 BOOLEAN ALGEBRA
CHAPTER 3 BOOLEAN ALGEBRA (continued) This chapter in the book includes: Objectives Study Guide 3.1 Multiplying Out and Factoring Expressions 3.2 Exclusive-OR and Equivalence Operations 3.3 The Consensus
More informationUNIT 3 BOOLEAN ALGEBRA (CONT D)
UNIT 3 BOOLEAN ALGEBRA (CONT D) Spring 2011 Boolean Algebra (cont d) 2 Contents Multiplying out and factoring expressions Exclusive-OR and Exclusive-NOR operations The consensus theorem Summary of algebraic
More informationE&CE 223 Digital Circuits & Systems. Lecture Transparencies (Boolean Algebra & Logic Gates) M. Sachdev
E&CE 223 Digital Circuits & Systems Lecture Transparencies (Boolean Algebra & Logic Gates) M. Sachdev 4 of 92 Section 2: Boolean Algebra & Logic Gates Major topics Boolean algebra NAND & NOR gates Boolean
More informationLecture 5: NAND, NOR and XOR Gates, Simplification of Algebraic Expressions
EE210: Switching Systems Lecture 5: NAND, NOR and XOR Gates, Simplification of Algebraic Expressions Prof. YingLi Tian Feb. 15, 2018 Department of Electrical Engineering The City College of New York The
More informationLecture 6: Manipulation of Algebraic Functions, Boolean Algebra, Karnaugh Maps
EE210: Switching Systems Lecture 6: Manipulation of Algebraic Functions, Boolean Algebra, Karnaugh Maps Prof. YingLi Tian Feb. 21/26, 2019 Department of Electrical Engineering The City College of New York
More informationChapter 2: Boolean Algebra and Logic Gates
Chapter 2: Boolean Algebra and Logic Gates Mathematical methods that simplify binary logics or circuits rely primarily on Boolean algebra. Boolean algebra: a set of elements, a set of operators, and a
More informationE&CE 223 Digital Circuits & Systems. Lecture Transparencies (Boolean Algebra & Logic Gates) M. Sachdev. Section 2: Boolean Algebra & Logic Gates
Digital Circuits & Systems Lecture Transparencies (Boolean lgebra & Logic Gates) M. Sachdev 4 of 92 Section 2: Boolean lgebra & Logic Gates Major topics Boolean algebra NND & NOR gates Boolean algebra
More informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 1 Gate Circuits and Boolean Equations Chapter 2 - Part 1 2 Chapter 2 - Part 1 3 Chapter 2 - Part 1 4 Chapter 2 - Part
More informationNumber System conversions
Number System conversions Number Systems The system used to count discrete units is called number system. There are four systems of arithmetic which are often used in digital electronics. Decimal Number
More informationBOOLEAN ALGEBRA TRUTH TABLE
BOOLEAN ALGEBRA TRUTH TABLE Truth table is a table which represents all the possible values of logical variables / statements along with all the possible results of the given combinations of values. Eg:
More informationBoolean Algebra & Logic Gates. By : Ali Mustafa
Boolean Algebra & Logic Gates By : Ali Mustafa Digital Logic Gates There are three fundamental logical operations, from which all other functions, no matter how complex, can be derived. These Basic functions
More informationUNIT 5 KARNAUGH MAPS Spring 2011
UNIT 5 KRNUGH MPS Spring 2 Karnaugh Maps 2 Contents Minimum forms of switching functions Two- and three-variable Four-variable Determination of minimum expressions using essential prime implicants Five-variable
More informationIn Module 3, we have learned about Exclusive OR (XOR) gate. Boolean Expression AB + A B = Y also A B = Y. Logic Gate. Truth table
Module 8 In Module 3, we have learned about Exclusive OR (XOR) gate. Boolean Expression AB + A B = Y also A B = Y Logic Gate Truth table A B Y 0 0 0 0 1 1 1 0 1 1 1 0 In Module 3, we have learned about
More informationChap 2. Combinational Logic Circuits
Overview 2 Chap 2. Combinational Logic Circuits Spring 24 Part Gate Circuits and Boolean Equations Binary Logic and Gates Boolean Algebra Standard Forms Part 2 Circuit Optimization Two-Level Optimization
More informationChapter 2: Switching Algebra and Logic Circuits
Chapter 2: Switching Algebra and Logic Circuits Formal Foundation of Digital Design In 1854 George Boole published An investigation into the Laws of Thoughts Algebraic system with two values 0 and 1 Used
More informationBoolean Algebra and Logic Design (Class 2.2 1/24/2013) CSE 2441 Introduction to Digital Logic Spring 2013 Instructor Bill Carroll, Professor of CSE
Boolean Algebra and Logic Design (Class 2.2 1/24/2013) CSE 2441 Introduction to Digital Logic Spring 2013 Instructor Bill Carroll, Professor of CSE Today s Topics Boolean algebra applications in logic
More informationChapter 2. Boolean Algebra and Logic Gates
Chapter 2 Boolean Algebra and Logic Gates Basic Definitions A binary operator defined on a set S of elements is a rule that assigns, to each pair of elements from S, a unique element from S. The most common
More information/ M Morris Mano Digital Design Ahmad_911@hotmailcom / / / / wwwuqucscom Binary Systems Introduction - Digital Systems - The Conversion Between Numbering Systems - From Binary To Decimal - Octet To Decimal
More informationChapter-2 BOOLEAN ALGEBRA
Chapter-2 BOOLEAN ALGEBRA Introduction: An algebra that deals with binary number system is called Boolean Algebra. It is very power in designing logic circuits used by the processor of computer system.
More informationGAMINGRE 8/1/ of 7
FYE 09/30/92 JULY 92 0.00 254,550.00 0.00 0 0 0 0 0 0 0 0 0 254,550.00 0.00 0.00 0.00 0.00 254,550.00 AUG 10,616,710.31 5,299.95 845,656.83 84,565.68 61,084.86 23,480.82 339,734.73 135,893.89 67,946.95
More informationCHAPTER 2 BOOLEAN ALGEBRA
CHAPTER 2 BOOLEAN ALGEBRA This chapter in the book includes: Objectives Study Guide 2.1 Introduction 2.2 Basic Operations 2.3 Boolean Expressions and Truth Tables 2.4 Basic Theorems 2.5 Commutative, Associative,
More informationCSE 140L Spring 2010 Lab 1 Assignment Due beginning of the class on 14 th April
CSE 140L Spring 2010 Lab 1 Assignment Due beginning of the class on 14 th April Objective - Get familiar with the Xilinx ISE webpack tool - Learn how to design basic combinational digital components -
More informationChapter 3. Boolean Algebra. (continued)
Chapter 3. Boolean Algebra (continued) Algebraic structure consisting of: set of elements B binary operations {+, -} unary operation {'} Boolean Algebra such that the following axioms hold:. B contains
More informationLecture 6: Gate Level Minimization Syed M. Mahmud, Ph.D ECE Department Wayne State University
Lecture 6: Gate Level Minimization Syed M. Mahmud, Ph.D ECE Department Wayne State University Original Source: Aby K George, ECE Department, Wayne State University Contents The Map method Two variable
More informationAnswers to Problems. For Fundamentals of Logic Design second edition (corrected version)
Answers to Problems For Fundamentals of Logic Design second edition (corrected version) 3 Answers to hapter Problems. (a) 5.875 (b) 38.5 (c) 53.5 (d) 574.75 (e) 4.4535 (f) 474.5. (a) = 33 9 (b) = A 6 (c)
More informationAPPLİCATION OF BOOLEAN ALGEABRA
APPLİCATION OF BOOLEAN ALGEABRA CHAPTER 4 Prof. Dr. Mehmet Akbaba Prof. Mehmet Akbaba Digital Logic 1 Multiplying Out and Factoring Expressions Given an expression in product-of-sums form, the corresponding
More information1. Expand each of the following functions into a canonical sum-of-products expression.
CHAPTER 4 PROLEMS 1. Expand each of the following functions into a canonical sum-of-products expression. (a) F(x, y, z) = xy + y z + x (b) F(w, x, y, z) = x y + wxy + w yz (c) F(A,,C,D) = AC + CD + C D
More informationBOOLEAN ALGEBRA. Introduction. 1854: Logical algebra was published by George Boole known today as Boolean Algebra
BOOLEAN ALGEBRA Introduction 1854: Logical algebra was published by George Boole known today as Boolean Algebra It s a convenient way and systematic way of expressing and analyzing the operation of logic
More informationBoolean Algebra and Logic Gates
Boolean Algebra and Logic Gates ( 范倫達 ), Ph. D. Department of Computer Science National Chiao Tung University Taiwan, R.O.C. Fall, 2017 ldvan@cs.nctu.edu.tw http://www.cs.nctu.edu.tw/~ldvan/ Outlines Basic
More informationUnit 2 Boolean Algebra
Unit 2 Boolean Algebra 1. Developed by George Boole in 1847 2. Applied to the Design of Switching Circuit by Claude Shannon in 1939 Department of Communication Engineering, NCTU 1 2.1 Basic Operations
More informationLecture 2 Review on Digital Logic (Part 1)
Lecture 2 Review on Digital Logic (Part 1) Xuan Silvia Zhang Washington University in St. Louis http://classes.engineering.wustl.edu/ese461/ Grading Engagement 5% Review Quiz 10% Homework 10% Labs 40%
More informationCombinational Logic Design Principles
Combinational Logic Design Principles Switching algebra Doru Todinca Department of Computers Politehnica University of Timisoara Outline Introduction Switching algebra Axioms of switching algebra Theorems
More informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 1 Gate Circuits and Boolean Equations Charles Kime & Thomas Kaminski 2008 Pearson Education, Inc. (Hyperlinks are active
More informationSolutions to Assignment No 5 Digital Techniques Fall 2007
Solutions to Assignment No 5 Digital Techniques Fall 2007 André Deutz October 19, 2007 1 Simplifying and Manipulating Boolean Expressions 1. Simplification (a) Simplify each of the following expressions,
More informationCS 121 Digital Logic Design. Chapter 2. Teacher Assistant. Hanin Abdulrahman
CS 121 Digital Logic Design Chapter 2 Teacher Assistant Hanin Abdulrahman 1 2 Outline 2.2 Basic Definitions 2.3 Axiomatic Definition of Boolean Algebra. 2.4 Basic Theorems and Properties 2.5 Boolean Functions
More information2 Application of Boolean Algebra Theorems (15 Points - graded for completion only)
CSE140 HW1 Solution (100 Points) 1 Introduction The purpose of this assignment is three-fold. First, it aims to help you practice the application of Boolean Algebra theorems to transform and reduce Boolean
More informationBoolean Algebra, Gates and Circuits
Boolean Algebra, Gates and Circuits Kasper Brink November 21, 2017 (Images taken from Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc.) Outline Last week: Von
More informationDigital Logic Design. Malik Najmus Siraj
Digital Logic Design Malik Najmus Siraj siraj@case.edu.pkedu LECTURE 4 Today s Agenda Recap 2 s complement Binary Logic Boolean algebra Recap Computer Arithmetic Signed numbers Radix and diminished radix
More informationHomework 3/ Solutions
MTH 310-3 Abstract Algebra I and Number Theory S17 Homework 3/ Solutions Exercise 1. Prove the following Theorem: Theorem Let R and S be rings. Define an addition and multiplication on R S by for all r,
More informationSignals and Systems Digital Logic System
Signals and Systems Digital Logic System Prof. Wonhee Kim Chapter 2 Design Process for Combinational Systems Step 1: Represent each of the inputs and outputs in binary Step 1.5: If necessary, break the
More informationMidterm Examination # 1 Wednesday, February 25, Duration of examination: 75 minutes
Page 1 of 10 School of Computer Science 60-265-01 Computer Architecture and Digital Design Winter 2009 Semester Midterm Examination # 1 Wednesday, February 25, 2009 Student Name: First Name Family Name
More informationChapter 4: Combinational Logic Solutions to Problems: [1, 5, 9, 12, 19, 23, 30, 33]
Chapter 4: Combinational Logic Solutions to Problems: [, 5, 9, 2, 9, 23, 3, 33] Problem: 4- Consider the combinational circuit shown in Fig. P4-. (a) Derive the Boolean expressions for T through T 4. Evaluate
More informationBinary logic consists of binary variables and logical operations. The variables are
1) Define binary logic? Binary logic consists of binary variables and logical operations. The variables are designated by the alphabets such as A, B, C, x, y, z, etc., with each variable having only two
More informationCombinational Logic. Review of Combinational Logic 1
Combinational Logic! Switches -> Boolean algebra! Representation of Boolean functions! Logic circuit elements - logic gates! Regular logic structures! Timing behavior of combinational logic! HDLs and combinational
More informationSYMBOL NAME DESCRIPTION EXAMPLES. called positive integers) negatives, and 0. represented as a b, where
EXERCISE A-1 Things to remember: 1. THE SET OF REAL NUMBERS SYMBOL NAME DESCRIPTION EXAMPLES N Natural numbers Counting numbers (also 1, 2, 3,... called positive integers) Z Integers Natural numbers, their
More informationBinary Logic and Gates. Our objective is to learn how to design digital circuits.
Binary Logic and Gates Introduction Our objective is to learn how to design digital circuits. These circuits use binary systems. Signals in such binary systems may represent only one of 2 possible values
More informationGate-Level Minimization
Gate-Level Minimization Dr. Bassem A. Abdullah Computer and Systems Department Lectures Prepared by Dr.Mona Safar, Edited and Lectured by Dr.Bassem A. Abdullah Outline 1. The Map Method 2. Four-variable
More informationCHAPTER III BOOLEAN ALGEBRA
CHAPTER III- CHAPTER III CHAPTER III R.M. Dansereau; v.. CHAPTER III-2 BOOLEAN VALUES INTRODUCTION BOOLEAN VALUES Boolean algebra is a form of algebra that deals with single digit binary values and variables.
More informationELCT201: DIGITAL LOGIC DESIGN
ELCT2: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Lecture 4 Following the slides of Dr. Ahmed H. Madian محرم 439 ه Winter 28
More informationAnswers. Chapter 9 A92. Angles Theorem (Thm. 5.6) then XZY. Base Angles Theorem (Thm. 5.6) 5, 2. then WV WZ;
9 9. M, 0. M ( 9, 4) 7. If WZ XZ, then ZWX ZXW ; Base Angles Theorem (Thm..6). M 9,. M ( 4, ) 74. If XZ XY, then XZY Y; Base Angles Theorem (Thm..6). M, 4. M ( 9, ) 7. If V WZV, then WV WZ; Converse of
More informationContents. Chapter 2 Digital Circuits Page 1 of 30
Chapter 2 Digital Circuits Page 1 of 30 Contents Contents... 1 2 Digital Circuits... 2 2.1 Binary Numbers... 2 2.2 Binary Switch... 4 2.3 Basic Logic Operators and Logic Expressions... 5 2.4 Truth Tables...
More informationCHAPTER III BOOLEAN ALGEBRA
CHAPTER III- CHAPTER III CHAPTER III R.M. Dansereau; v.. CHAPTER III-2 BOOLEAN VALUES INTRODUCTION BOOLEAN VALUES Boolean algebra is a form of algebra that deals with single digit binary values and variables.
More informationcontrol in out in out Figure 1. Binary switch: (a) opened or off; (b) closed or on.
Chapter 2 Digital Circuits Page 1 of 18 2. Digital Circuits Our world is an analog world. Measurements that we make of the physical objects around us are never in discrete units but rather in a continuous
More informationECE 238L Boolean Algebra - Part I
ECE 238L Boolean Algebra - Part I August 29, 2008 Typeset by FoilTEX Understand basic Boolean Algebra Boolean Algebra Objectives Relate Boolean Algebra to Logic Networks Prove Laws using Truth Tables Understand
More informationHardware Design I Chap. 2 Basis of logical circuit, logical expression, and logical function
Hardware Design I Chap. 2 Basis of logical circuit, logical expression, and logical function E-mail: shimada@is.naist.jp Outline Combinational logical circuit Logic gate (logic element) Definition of combinational
More information1. Prove: A full m- ary tree with i internal vertices contains n = mi + 1 vertices.
1. Prove: A full m- ary tree with i internal vertices contains n = mi + 1 vertices. Proof: Every vertex, except the root, is the child of an internal vertex. Since there are i internal vertices, each of
More informationLecture 7: Karnaugh Map, Don t Cares
EE210: Switching Systems Lecture 7: Karnaugh Map, Don t Cares Prof. YingLi Tian Feb. 28, 2019 Department of Electrical Engineering The City College of New York The City University of New York (CUNY) 1
More informationChapter 2 : Boolean Algebra and Logic Gates
Chapter 2 : Boolean Algebra and Logic Gates By Electrical Engineering Department College of Engineering King Saud University 1431-1432 2.1. Basic Definitions 2.2. Basic Theorems and Properties of Boolean
More informationLogic Design I (17.341) Fall Lecture Outline
Logic Design I (17.341) Fall 2011 Lecture Outline Class # 06 October 24, 2011 Dohn Bowden 1 Today s Lecture Administrative Main Logic Topic Homework 2 Course Admin 3 Administrative Admin for tonight Syllabus
More informationUNIT 4 MINTERM AND MAXTERM EXPANSIONS
UNIT 4 MINTERM AND MAXTERM EXPANSIONS Spring 2 Minterm and Maxterm Expansions 2 Contents Conversion of English sentences to Boolean equations Combinational logic design using a truth table Minterm and
More informationDIGITAL ELECTRONICS & it0203 Semester 3
DIGITAL ELECTRONICS & it0203 Semester 3 P.Rajasekar & C.M.T.Karthigeyan Asst.Professor SRM University, Kattankulathur School of Computing, Department of IT 8/22/2011 1 Disclaimer The contents of the slides
More informationCHAPTER 7. Exercises 17/ / /2 2 0
CHAPTER 7 Exercises E7. (a) For the whole part, we have: Quotient Remainders 23/2 /2 5 5/2 2 2/2 0 /2 0 Reading the remainders in reverse order, we obtain: 23 0 = 0 2 For the fractional part we have 2
More informationSystems I: Computer Organization and Architecture
Systems I: Computer Organization and Architecture Lecture 6 - Combinational Logic Introduction A combinational circuit consists of input variables, logic gates, and output variables. The logic gates accept
More informationChapter 2. Digital Logic Basics
Chapter 2 Digital Logic Basics 1 2 Chapter 2 2 1 Implementation using NND gates: We can write the XOR logical expression B + B using double negation as B+ B = B+B = B B From this logical expression, we
More informationCDA 3200 Digital Systems. Instructor: Dr. Janusz Zalewski Developed by: Dr. Dahai Guo Spring 2012
CDA 3200 Digital Systems Instructor: Dr. Janusz Zalewski Developed by: Dr. Dahai Guo Spring 2012 Outline Combinational Logic Design Using a Truth Table Minterm and Maxterm Expansions General Minterm and
More informationENG2410 Digital Design Combinational Logic Circuits
ENG240 Digital Design Combinational Logic Circuits Fall 207 S. Areibi School of Engineering University of Guelph Binary variables Binary Logic Can be 0 or (T or F, low or high) Variables named with single
More informationCombinational Logic. Course Instructor Mohammed Abdul kader
Combinational Logic Contents: Combinational and Sequential digital circuits. Design Procedure of combinational circuit. Adders: Half adder and Full adder. Subtractors: Half Subtractor and Full Subtractor.
More informationLOGIC GATES. Basic Experiment and Design of Electronics. Ho Kyung Kim, Ph.D.
Basic Eperiment and Design of Electronics LOGIC GATES Ho Kyung Kim, Ph.D. hokyung@pusan.ac.kr School of Mechanical Engineering Pusan National University Outline Boolean algebra Logic gates Karnaugh maps
More informationAlgebraic Expressions
Algebraic Expressions 1. Expressions are formed from variables and constants. 2. Terms are added to form expressions. Terms themselves are formed as product of factors. 3. Expressions that contain exactly
More informationANSWERS. CLASS: VIII TERM - 1 SUBJECT: Mathematics. Exercise: 1(A) Exercise: 1(B)
ANSWERS CLASS: VIII TERM - 1 SUBJECT: Mathematics TOPIC: 1. Rational Numbers Exercise: 1(A) 1. Fill in the blanks: (i) -21/24 (ii) -4/7 < -4/11 (iii)16/19 (iv)11/13 and -11/13 (v) 0 2. Answer True or False:
More informationThe least element is 0000, the greatest element is 1111.
Note: this worksheet has been modified to emphasize the Boolean algebra content. Some problems have been deleted.; this, for instance, is why the first problem is #5 rather than #1. 5. Let A be the set
More informationLESSON 7.1 FACTORING POLYNOMIALS I
LESSON 7.1 FACTORING POLYNOMIALS I LESSON 7.1 FACTORING POLYNOMIALS I 293 OVERVIEW Here s what you ll learn in this lesson: Greatest Common Factor a. Finding the greatest common factor (GCF) of a set of
More informationCHAPTER 12 Boolean Algebra
318 Chapter 12 Boolean Algebra CHAPTER 12 Boolean Algebra SECTION 12.1 Boolean Functions 2. a) Since x 1 = x, the only solution is x = 0. b) Since 0 + 0 = 0 and 1 + 1 = 1, the only solution is x = 0. c)
More informationSample Marking Scheme
Page 1 of 10 School of Computer Science 60-265-01 Computer Architecture and Digital Design Fall 2008 Midterm Examination # 1 B Wednesday, November 5, 2008 Sample Marking Scheme Duration of examination:
More informationLogic Design. Chapter 2: Introduction to Logic Circuits
Logic Design Chapter 2: Introduction to Logic Circuits Introduction Logic circuits perform operation on digital signal Digital signal: signal values are restricted to a few discrete values Binary logic
More informationContents. Chapter 3 Combinational Circuits Page 1 of 36
Chapter 3 Combinational Circuits Page of 36 Contents Combinational Circuits...2 3. Analysis of Combinational Circuits...3 3.. Using a Truth Table...3 3..2 Using a Boolean Function...6 3.2 Synthesis of
More informationSAMPLE ANSWERS MARKER COPY
Page 1 of 12 School of Computer Science 60-265-01 Computer Architecture and Digital Design Fall 2012 Midterm Examination # 1 Tuesday, October 23, 2012 SAMPLE ANSWERS MARKER COPY Duration of examination:
More informationChapter 2 Boolean Algebra and Logic Gates
Ch1: Digital Systems and Binary Numbers Ch2: Ch3: Gate-Level Minimization Ch4: Combinational Logic Ch5: Synchronous Sequential Logic Ch6: Registers and Counters Switching Theory & Logic Design Prof. Adnan
More informationEC-121 Digital Logic Design
EC-121 Digital Logic Design Lecture 2 [Updated on 02-04-18] Boolean Algebra and Logic Gates Dr Hashim Ali Spring 2018 Department of Computer Science and Engineering HITEC University Taxila!1 Overview What
More informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 1 Gate Circuits and Boolean Equations Charles Kime & Thomas Kaminski 2008 Pearson Education, Inc. Overview Part 1 Gate
More informationECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 2 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Week 2 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering Boolean Algebra Boolean Algebra A Boolean algebra is defined with: A set of
More informationTHE RING OF POLYNOMIALS. Special Products and Factoring
THE RING OF POLYNOMIALS Special Products and Factoring Special Products and Factoring Upon completion, you should be able to Find special products Factor a polynomial completely Special Products - rules
More informationChapter 2 Boolean Algebra and Logic Gates
Chapter 2 Boolean Algebra and Logic Gates Huntington Postulates 1. (a) Closure w.r.t. +. (b) Closure w.r.t.. 2. (a) Identity element 0 w.r.t. +. x + 0 = 0 + x = x. (b) Identity element 1 w.r.t.. x 1 =
More informationMidterm1 Review. Jan 24 Armita
Midterm1 Review Jan 24 Armita Outline Boolean Algebra Axioms closure, Identity elements, complements, commutativity, distributivity theorems Associativity, Duality, De Morgan, Consensus theorem Shannon
More informationBoolean Algebra and Logic Gates Chapter 2. Topics. Boolean Algebra 9/21/10. EECE 256 Dr. Sidney Fels Steven Oldridge
Boolean Algebra and Logic Gates Chapter 2 EECE 256 Dr. Sidney Fels Steven Oldridge Topics DefiniGons of Boolean Algebra Axioms and Theorems of Boolean Algebra two valued Boolean Algebra Boolean FuncGons
More informationWeek-I. Combinational Logic & Circuits
Week-I Combinational Logic & Circuits Overview Binary logic operations and gates Switching algebra Algebraic Minimization Standard forms Karnaugh Map Minimization Other logic operators IC families and
More informationChapter 2: Princess Sumaya Univ. Computer Engineering Dept.
hapter 2: Princess Sumaya Univ. omputer Engineering Dept. Basic Definitions Binary Operators AND z = x y = x y z=1 if x=1 AND y=1 OR z = x + y z=1 if x=1 OR y=1 NOT z = x = x z=1 if x=0 Boolean Algebra
More informationCS/COE0447: Computer Organization and Assembly Language
CS/COE0447: Computer Organization and Assembly Language Logic Design Introduction (Brief?) Appendix B: The Basics of Logic Design Dept. of Computer Science Logic design? Digital hardware is implemented
More informationDigital Logic Design. Combinational Logic
Digital Logic Design Combinational Logic Minterms A product term is a term where literals are ANDed. Example: x y, xz, xyz, A minterm is a product term in which all variables appear exactly once, in normal
More informationDigital Techniques. Figure 1: Block diagram of digital computer. Processor or Arithmetic logic unit ALU. Control Unit. Storage or memory unit
Digital Techniques 1. Binary System The digital computer is the best example of a digital system. A main characteristic of digital system is its ability to manipulate discrete elements of information.
More informationAdvanced Digital Design with the Verilog HDL, Second Edition Michael D. Ciletti Prentice Hall, Pearson Education, 2011
Problem 2-1 Recall that a minterm is a cube in which every variable appears. A Boolean expression in SOP form is canonical if every cube in the expression has a unique representation in which all of the
More information( c) Give logic symbol, Truth table and circuit diagram for a clocked SR flip-flop. A combinational circuit is defined by the function
Question Paper Digital Electronics (EE-204-F) MDU Examination May 2015 1. (a) represent (32)10 in (i) BCD 8421 code (ii) Excess-3 code (iii) ASCII code (b) Design half adder using only NAND gates. ( c)
More informationChapter 2 Boolean Algebra and Logic Gates
Chapter 2 Boolean Algebra and Logic Gates The most common postulates used to formulate various algebraic structures are: 1. Closure. N={1,2,3,4 }, for any a,b N we obtain a unique c N by the operation
More informationDHANALAKSHMI COLLEGE OF ENGINEERING, CHENNAI DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING CS6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN
DHANALAKSHMI COLLEGE OF ENGINEERING, CHENNAI DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING CS6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN UNIT I : BOOLEAN ALGEBRA AND LOGIC GATES PART - A (2 MARKS) Number
More informationSymmetry. PlayMath, Summer, 2018
This essay is about the use of symmetry in solving algebra and geometry problems From Wikipedia we learn that symmetry (from Greek symmetra measure together ) generally conveys two primary meanings The
More information1. Name the person who developed Boolean algebra
MATHEMATIC CENTER D96 MUNIRKA VILLAGE NEW DELHI 67 & VIKAS PURI NEW DELHI CONTACT FOR COACHING MATHEMATICS FOR TH 2TH NDA DIPLOMA SSC CAT SAT CPT CONTACT FOR ADMISSION GUIDANCE B.TECH BBA BCA, MCA MBA
More informationChapter 2 Combinational
Computer Engineering 1 (ECE290) Chapter 2 Combinational Logic Circuits Part 1 Gate Circuits and Boolean Equations HOANG Trang Reference: 2008 Pearson Education, Inc. Overview Part 1 Gate Circuits and Boolean
More informationChapter 10 Exercise 10.1
Chapter 0 Exercise 0. Q.. A(, ), B(,), C(, ), D(, ), E(0,), F(,), G(,0), H(, ) Q.. (i) nd (vi) st (ii) th (iii) nd (iv) rd (v) st (vii) th (viii) rd (ix) st (viii) rd Q.. (i) Y (v) X (ii) Y (vi) X (iii)
More information