The least element is 0000, the greatest element is 1111.
|
|
- Roger Collins
- 5 years ago
- Views:
Transcription
1 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 of all bit strings of length 4. Define a partial order on A as follows: x y iff x y = x, where is bitwise conjunction. Does the poset (A, ) have a greatest element? A least element? Draw the Hasse diagram. The least element is 0000, the greatest element is *. Referring to the structure in the previous exercise, define operations product, sum and complement as bitwise conjunction, disjunction and negation, respectively. Then this structure is a Boolean algebra. Find: a Answer: 1101 b Answer: 0100 c Answer: = =1101 d ( ) Answer: ( ) = =1101
2 7. Let A = {1, 2, 3, 5, 6, 10, 15, 30}. Draw the Hasse diagram for the poset (A, ). Is this poset a lattice? This poset is a lattice. We can see that for arbitrary a, b: LUB{a, b} = LCM(a, b) and GLB{a, b} = GCD(a, b}. 7*. Referring to the structure in the previous exercise, define product, sum, and complement as follows: xy = GCD(x, y), x+y = LCM(x, y), x = 30 x Then this structure is a Boolean algebra. A. What integer is the 0 (zero) identity element? Answer: 1 B. What integer is the 1 (unit) identity element? Answer: 30 C. Find 5 10 and 5+10 Answers: 5 10 = 5, 5+10 = 10 D. Find 2 + (2 10) and 2(2+10) Answers: 2 + (2 10) = 2 and 2(2+10) = 2 (absorption laws) E. Find 3 + (5 15) Answer: 5 15 = 5 so 3+(5 15) = 3+5 = 15 F. Find Answer: = 2 10 =15 3 = Use Boolean identities, and algebra, to prove x y + y + z = y z + x ( ) Justify each step in the proof. Do not skip or combine steps. Here is one correct proof:
3 x y + y + z = x y + yz//demorgan'slaw = yx + yz//commutativelaw = y( x + z)//distributivelaw = y( z + x)//commutativelaw There are other correct proofs. We do not need to find the shortest proof just a proof in which each step is correct. However, if you write a shorter proof, you are invited to send it to Mr. Wooland. 11. Use Boolean identities, and algebra, to prove x xy + zy ( ) = x Justify each step of the proof. Do not skip or combine steps. Here is one proof. It is not the only correct proof. x( xy + zy) = xxy + x yz//distributivelaw = xy + x yz//idempotentlaw = xy + x( y + z)//demorgan'slaw = xy + x y + xz//distributivelaw = x( y + y)+ xz//distributivelaw = x( 1)+ xz//complementslaw =x + xz//identitylaw =x//absorptionlaw There are other correct proofs. We do not need to find the shortest proof just a proof in which each step is correct. However, if you write a shorter proof, you are invited to send it to Mr. Wooland. 12. T F The set { +, } is functionally complete. Proof: Since our set of operators contains both sum and negation, we only need to prove that product can be expressed in terms of sums and negations: xy = xy //Double negation = x + y //DeMorgan's Law and double negation
4 13. Write a Boolean expression that is equivalent to xyz + yz, but without any products. Solution: xyz + yz = xyz + yz //Double negation = x + y + z + y + z //DeMorgan's Law, double negation 14. T F The set {, } is functionally complete. Proof: Since our set of operators contains both sum and product, we only need to prove that sum can be expressed used products and negations: x + y = x + y //Double negation = x y //DeMorgan's Law 15. Write a Boolean expression that is equivalent to xyz + yz, but without any sums. Solution: xyz + yz = xyz + yz //Double negation = xyz yz //DeMorgan's Law 16. T F If the set, { } is functionally complete, then the set Proof: Since we have the hypothesis that {, }, we can prove that showing that negation and product can be expressed using only the nor operator. We will also use the definition: x y = x + y. First, x = x x //Idempotent Law = x + x //DeMorgan's Law = x x //Definition of nor Next, xy = x + y //DeMorgan's Law = x y //Definition of nor = ( x x) ( y y) //because a = a a { } is functionally complete. { } is functionally complete by
5 This shows that negations and products can be expressed using only the nor operator, so the nor operator is functionally complete. 17. T F If the set +, { } is functionally complete, then the set {} is functionally complete. Proof: Since we have the hypothesis that { +, }, we can prove that {} is functionally complete by showing that sum and negation can be expressed using only the nand operator. We will also use the definition: x y = xy. First, x = x + x //Idempotent Law = x x //DeMorgan's Law = x x //Definition of nand Next, x + y = x y //DeMorgan's Law = x y //Definition of nand = ( x x) ( y y) //because a = a a This shows that negations and sums can be expressed using only the nand operator, so the nand operator is functionally complete. 18. Use algebra (not a truth table) to derive the sum of products expansion (aka disjunctive normal ( ) y + z ( ) = xz + x + yz form) for F x, y,z steps. You must write the answer using lexicographic order. The answer is: x yz + x yz + x yz Here is the derivation: ( ). You don t have to justify the steps. You may skip or combine
6 ( ) y + z ( ) yz xz + x + yz = xz + x + yz ( ) = xz + x yz + yz yz = xz + x yz + yzz = xz + x yz + y 0 = xz + x yz = xz( y + y)+ x yz = x yz + x yz + x yz = x yz + x yz + x yz 19. Use algebra (not a truth table) to derive the sum of products expansion (aka disjunctive normal form) for F ( x, y,z) = x( y + z)+ yz. You don t have to justify the steps. You may skip or combine steps. You must write the answer using lexicographic order. The answer is: xyz + x yz + x yz + x yz Here is the derivation, with some terse explanations. x( y + z)+ yz = x y + xz + yz //distributive law ( ) + xz ( y + y ) + yz ( x + x ) = x y z + z = x yz + x yz + x yz + x yz + xyz + x yz //distribute //multiply various terms by 1 = xyz + x yz + x yz + x yz //place minterms in correct order, remove redundant minterms 20. Use algebra (not a truth table) to derive the sum of products expansion (aka disjunctive normal form) for F ( x, y,z) = ( x + y) yz. You don t have to justify the steps. You may skip or combine steps. You must write the answer using lexicographic order. The answer is: x yz + x yz
7 ( x + y) yz ( ) = x y y + z //DeMorgan's Laws = x y + x yz //Distributive and Idempotent Laws ( ) = x y z + z + x yz //Multiply a term by 1 = x yz + x yz + x yz //Distributive Law = x yz + x yz //Idempotent Law & check correct ordering of minterms 21. Use Boolean identities, and algebra, to prove ( y + x) x + y =1. Justify each step of the proof. Do not skip or combine steps. Here is one proof. It is not the only correct proof. ( y + x) x + y = ( y + x)+ x + y //DeMorgan's Law, Double Negation = ( y + x)+ [ x + y] //Associative Law = ( x + y)+ [ x + y] //Commutative Law =1 //Complements Law 22. Using, as needed, the Identity, Complements, Commutative, Associative and Distributive laws as axioms, prove this Idempotent law: x x = x. Proof: x = x 1//Identitylaw = x( x + x)//complementslaw = x x + x x//distributivelaw = x x +0//Complementslaw = x x//identitylaw 23. Using, as needed, the Identity, Complements, Commutative, Associative and Distributive laws as axioms, prove this Idempotent law: x + x = x. Proof:
8 x = x +0//Identitylaw = x + ( x x)//complementslaw = ( x + x) ( x + x )//Distributivelaw == ( x + x) 1//Complementslaw = x + x//identitylaw 24. Having proven the Idempotent laws (Exercises 22 and 23 above), use them as needed, along with the Identity, Complements, Commutative, Associative and Distributive laws as axioms, to prove this Domination law: x 0 = 0 Proof: x 0 = x ( x x)//complementslaw = ( x x) x//associativelaw = x x//idempotentlaw = 0//Complementslaw 25. Having proven the Idempotent laws (Exercises 22 and 23 above), use them as needed, along with the Identity, Complements, Commutative, Associative and Distributive laws as axioms, to prove this Domination law: x +1 = 1 Proof: x +1 = x + ( x + x)//complementslaw = ( x + x)+ x//associativelaw = x + x//idempotentlaw = 1//Complementslaw 26. Having proven the Idempotent and Domination laws (Exercises above), use them as needed, along with the Identity, Complements, Commutative, Associative and Distributive laws as axioms, to prove this Absorption law: x + xy = x Proof:
9 x + xy = x 1+ xy//identitylaw = x( 1+ y)//distributivelaw = x 1//Dominationlaw = x//identitylaw 27. Having proven the Idempotent and Domination laws (Exercises above), use them as needed, along with the Identity, Complements, Commutative, Associative and Distributive laws as axioms, to ( ) = x prove this Absorption law: x x + y Proof: ( ) ( ) x + y x x + y = x +0 ( )//Identitylaw = x + ( 0 y)//distributivelaw = x +0//Dominationlaw = x//identitylaw 28. Prove the following theorem for x and y in a Boolean algebra: y = xifandonlyify + x = 1andy x = 0. Proof One direction ( )of the biconditional is obvious. For the non- obvious direction ( ), we must prove: If y + x = 1andy x = 0 then y = x. Assume y + x = 1andy x = 0. Then
10 y = y 1//Identitylaw = y(x + x)//complementslaw = yx + yx//distributivelaw = yx +0//Hypothesis = yx + x x//identitylaw = x y + xx//commutativelaw2 = x ( y + x)//distributivelaw = x 1//Hypothesis = x//identitylaw 29. Use the result from #28 to prove this DeMorgan law: x + y = x y Proof: According to the previous theorem, we can prove this by proving two things: A. x + y + x y = 1 ( ) x y B. x + y ( ) = 0 Here is the proof of (A): ( x + y)+ x y = (( x + y)+ x)+ (( x + y)+ y)//distributivelaw,twice = (( y + x)+ x)+ (( x + y)+ y)//commutativelaw,twice ( ( )) + x + ( y + y ) ( ) //Associativelaw,twice = y + x + x = ( y +1)+ ( x +1)//Complementslaw,twice = 1+1//Dominationlaw,twice = 1//Dominationlaw
11 Here is the proof of (B): ( x + y) ( x y) = x y ( )//Commutativelaw ( ) x + y = x y x + x y y//distributivelaw = x x y + x y y//commutativelaw,twice = 0 y + x 0//Complementslaw,twice = 0+0//Dominationlaw,twice = 0//Idempotentlaw 30. Use the result from #28 to prove this DeMorgan law: xy = x + y Proof: According to the previous theorem, we can prove this by proving two things: A. xy + x + y ( ) = 1 B. xy x + y ( ) = 0 Here is the proof of (A): ( ) xy + x + y = ( xy + x)+ y//associativelaw = ( x + xy)+ y//commutativelaw = ( x + x) ( x + y)+ y//distributivelaw = 1 ( x + y)+ y//complementslaw = ( x + y)+ y//identitylaw = x + ( y + y )//Associativelaw = x +1//Complementslaw =1//Dominationlaw Here is the proof of (B): xy( x + y) = xyx + xy y//distributivelaw = x x y + xy y//commutativelaw = 0 y + x 0//Complementslaw,twice = 0+0//Dominationlaw,twice = 0//Idempotentlaw
12 31. Use algebra to derive the sum of products expansion (aka disjunctive normal form) for ( ) ( ) = x + z + y x + z F x, y,z You may skip/combine steps. You don t have to write the justifications. Your answer must be written using lexicographic order. Answer: x yz + x yz + x yz + x yz Solution: Here is one derivation. Some justifications have been provided, for pedagogical reasons, but you would not have to write those justifications on a test. x + z + y( x + z) = x z + yx + yz //DeMorgan's law, Distributive law ( ) + yx ( z + z ) + yz ( x + x ) = xz y + y //Multiply terms by 1, in 3 places = x yz + x yz + x yz + x yz + x yz + x yz //Distributive law 3, also Commutative law to arrange literals = x yz + x yz + x yz + x yz //Commutative law to arrange minterms lexicographically, // also Idempotent law to remove redundant minterm 32. Use algebra, not a truth table, to derive the sum of products expansion for F ( x, y, x) = z( y + x) You may skip/combine steps. You do not have to justify the steps. You must write your answer using lexicographic order. Answer: xyz + xyz + xyz + xyz + xyz Solution: Here is one derivation. Some justifications have been provided, for pedagogical reasons, but you would not have to write those justifications on a test (for this style of problem, only).
13 ( ) ( ) //DeMorgan's Law z y + x = z + y + x = z + yx //DeMorgan's Law = z( x + x)+ yx z + z ( ) //Multiply terms by 1, in two places = zx + zx + yxz + yxz //Distributive law = zx( y + y)+ zx( y + y)+ yxz + yxz //Multiply terms by 1, in two places = zxy + zxy + zxy + zxy + yxz + yxz //Distributive law = xyz + xyz + xyz + xyz + xyz + xyz //Commutative law, repeatedly, to arrange literals within minterms = xyz + xyz + xyz + xyz + xyz + xyz //Commutative law, repeatedly, to arrange minterms lexicographically = xyz + xyz + xyz + xyz + xyz //Idempotent law removes a redundant minterm 33. Let D 30 = { n :n 30}, and define product, sum and complement as follows: x y = gcd(x, y), x+y= lcm(x, y), x = 30 x. The symbols 0 and 1 represent the zero and unit identity elements, respectectively (not necessarily the integers 0 and 1). a. What are the atoms of this Boolean algebra? Answers: 2, 3, 5 b. Find 6+10 and Answers: 6+10 = 1, 6 10 = 2 (note that 1 means the integer 30 in this Boolean algebra). c. Find 2+15 and Answers: 2+15 = 1, 2 15 = 0 (note that 1 means the integer 30 in this Boolean algebra; 0 represents the integer 1). d. Find 3+6 and 3 6. Answers: 3+6 = 6, 3 6 = 3 e. Find 5,10,and15. Answers: 5 = 6,10 = 3,and15 = 2 f. Express 15 as a unique sum of atoms. Answer: 15 = Let D 165 = { n :n 165}, and define product, sum and complement as follows: x y = gcd(x, y), x+y= lcm(x, y), x = 165 x. The symbols 0 and 1 represent the zero and unit identity elements, respectectively (not necessarily the integers 0 and 1).
14 a. What are the atoms of this Boolean algebra? Answers: 3, 5, 11 b. Find 3+11 and Answers: 3+11 = 33, 3 11 = 0 (note that 1 means the integer 165 in this Boolean algebra; 0 represents the integer 1). c. Find 5+15 and Answers: 5+15 = 5, 5 15 = 5 d. Find and Answers: = 1, = 11 e. Find 5,33,and15. Answers: 5 = 33,33= 5,and15 = 11 f. Express 55 as a unique sum of atoms. Answer: 55 = Let U = {1, 2, 3, 4} and let 2 4 be the power set of U with the operations x y = x y x+y= x y, and letx be defined by the set math complement operation. a. What are the atoms of this Boolean algebra? Answers: {1}, {2}, {3}, {4} b. What is the zero identity element? Answer: c. What is the unit identity element? Answer: U d. Find {2, 3}+{1, 3} and {2, 3} {1, 3}. Answers: {2, 3}+{1, 3} = {1, 2, 3} and {2, 3} {1, 3} = {3}. e. Find {1, 2, 4}+{2, 3, 4} and {1, 2, 4} {2, 3, 4}. Answers: {1, 2, 4}+{2, 3, 4} = 1 and {1, 2, 4} {2, 3, 4} = {2, 4}. f. Find {2, 3}+{2, 3, 4} and {2, 3} {2, 3, 4}. Answers: {2, 3}+{2, 3, 4} = {2, 3, 4} and {2, 3} {2, 3}.
15 g. Find 2 { },{ 3,4},and 1,2,3 Answers: 2 { } = { 1,3,4}, 3,4 { }. { } = 1,2 { },and 1,2,3 h. Express {2, 4} as a unique sum of atoms. Answer: {2, 4} = {2} + {4} i. Express {1, 3, 4} as a unique sum of atoms. Answer: {1, 3, 4} = {2} + {3} + {4} { } = { 4}. j. T F This Boolean algebra is isomorphic to D30. This Boolean algebra is isomorphic to all finite Boolean algebras with 4 atoms, but D30 has only 3 atoms. 36. Let B6 be the set of all bit strings of length six and define the operations product, sum and complement as bitwise conjunction, disjunction and negation, respectively. a. What are the atoms of this Boolean algebra? Answers: , , , , , and b. What is the zero identity element? Answer: c. What is the unit identity element? Answer: d. Find and Answers: = 1 and = e. Find and Answers: = and = f. Find and Answers: = and = 0. g. Find ,010000,and Answers: = , = ,and = h. Express as a unique sum of atoms. Answer: =
16 i. Express as a unique sum of atoms. Answer: = j. T F This Boolean algebra is isomorphic to 2 6. Every finite Boolean algebra with 6 atoms is isomorphic to T F If B is a Boolean algebra such that B > 1, then there is no x such that x = x (that is, no element is its own complement). Proof: Suppose B is a Boolean algebra such that B > 1, and let x be an element such that x = x. According to the Complements Laws, we know that x + x = 1 and x x = 0. But since x = x, this means x + x = 1 and x x = 0. Then from the Idempotent Laws, we have x = 1 and x = 0, so 1 = 0, which is a contradiction. Comment: in the degenerate case where 0=1 in a Boolean algebra, the Boolean algebra has only one element. To see this, suppose y is any element of a Boolean algebra where 0 = 1. We will show that y = 0 = 1: y = y 1 //Identity law = y 0 //Because 1=0 = 0 //Domination law = 1 //Because 0 =1 This shows that in the degenerate or trivial Boolean algebra where 0=1, all elements are equal, hence there is only one element. 38. Let D 16 = { n :n 16}, and define product, sum and complement as follows: x y = gcd(x, y), x+y= lcm(x, y), x = 16 x. The symbols 0 and 1 represent the zero and unit identity elements, respectively (not necessarily the integers 0 and 1). T F D16 is a Boolean algebra. Proof : Note that, if this were a Boolean algebra, then 4 would be its own complement. Exercise #37 above tells us that in a nontrivial Boolean algebra, no element is its own complement. 39. Let D 36 = { n :n 36}, and define product, sum and complement as follows: x y = gcd(x, y),
17 x+y = lcm(x, y), x = 36 x. The symbols 0 and 1 represent the zero and unit identity elements, respectively (not necessarily the integers 0 and 1). T F D36 is a Boolean algebra. Proof: Note that, if this were a Boolean algebra, then 6 would be its own complement. Exercise #37 above tells us that in a nontrivial Boolean algebra, no element is its own complement. 40. Omit 41. Let D 12 = { n :n 12}= { 1,2,3,4,6,12}, and define product, sum and complement as follows: x y = gcd(x, y), x+y = lcm(x, y), x = 12 x. The symbols 0 and 1 represent the zero and unit identity elements, respectively (not necessarily the integers 0 and 1). Explain why this is not a Boolean algebra. Answer: In this case, no element is its own complement, but still the Complements Law fails. Note that 2= 6, so according to the Complements Law, it must be the case that ( ) 2+2= 1 = 12,because12istheunityidentity But instead, we have 2+2= 1 = 2+6 = 6 Since the Complements Law fails, this structure is not a Boolean algebra.
1. 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 informationBoolean Algebra CHAPTER 15
CHAPTER 15 Boolean Algebra 15.1 INTRODUCTION Both sets and propositions satisfy similar laws, which are listed in Tables 1-1 and 4-1 (in Chapters 1 and 4, respectively). These laws are used to define an
More informationLogic Gate Level. Part 2
Logic Gate Level Part 2 Constructing Boolean expression from First method: write nonparenthesized OR of ANDs Each AND is a 1 in the result column of the truth table Works best for table with relatively
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 informationCHAPTER1: Digital Logic Circuits Combination Circuits
CS224: Computer Organization S.KHABET CHAPTER1: Digital Logic Circuits Combination Circuits 1 PRIMITIVE LOGIC GATES Each of our basic operations can be implemented in hardware using a primitive logic gate.
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 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 informationWe last time we began introducing equivalency laws.
Monday, January 14 MAD2104 Discrete Math 1 Course website: www/mathfsuedu/~wooland/mad2104 Today we will continue in Course Notes Chapter 22 We last time we began introducing equivalency laws Today we
More information3. Abstract Boolean Algebras
3. ABSTRACT BOOLEAN ALGEBRAS 123 3. Abstract Boolean Algebras 3.1. Abstract Boolean Algebra. Definition 3.1.1. An abstract Boolean algebra is defined as a set B containing two distinct elements 0 and 1,
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 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 informationDigital Circuit And Logic Design I. Lecture 3
Digital Circuit And Logic Design I Lecture 3 Outline Combinational Logic Design Principles (). Introduction 2. Switching algebra 3. Combinational-circuit analysis 4. Combinational-circuit synthesis Panupong
More informationUnit 2 Boolean Algebra
Unit 2 Boolean Algebra 2.1 Introduction We will use variables like x or y to represent inputs and outputs (I/O) of a switching circuit. Since most switching circuits are 2 state devices (having only 2
More informationFunctions. Computers take inputs and produce outputs, just like functions in math! Mathematical functions can be expressed in two ways:
Boolean Algebra (1) Functions Computers take inputs and produce outputs, just like functions in math! Mathematical functions can be expressed in two ways: An expression is finite but not unique f(x,y)
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 informationBoolean Algebra. Philipp Koehn. 9 September 2016
Boolean Algebra Philipp Koehn 9 September 2016 Core Boolean Operators 1 AND OR NOT A B A and B 0 0 0 0 1 0 1 0 0 1 1 1 A B A or B 0 0 0 0 1 1 1 0 1 1 1 1 A not A 0 1 1 0 AND OR NOT 2 Boolean algebra Boolean
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 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 informationEarlier this week we defined Boolean atom: A Boolean atom a is a nonzero element of a Boolean algebra, such that ax = a or ax = 0 for all x.
Friday, April 20 Today we will continue in Course Notes 3.3: Abstract Boolean Algebras. Earlier this week we defined Boolean atom: A Boolean atom a is a nonzero element of a Boolean algebra, such that
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 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 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 informationBoolean Algebra. Examples: (B=set of all propositions, or, and, not, T, F) (B=2 A, U,, c, Φ,A)
Boolean Algebra Definition: A Boolean Algebra is a math construct (B,+,.,, 0,1) where B is a non-empty set, + and. are binary operations in B, is a unary operation in B, 0 and 1 are special elements of
More informationLogic Synthesis and Verification
Logic Synthesis and Verification Boolean Algebra Jie-Hong Roland Jiang 江介宏 Department of Electrical Engineering National Taiwan University Fall 2014 1 2 Boolean Algebra Reading F. M. Brown. Boolean Reasoning:
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 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 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 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 informationTutorial Obtain the principal disjunctive normal form and principal conjunction form of the statement
Tutorial - 1 1. Obtain the principal disjunctive normal form and principal conjunction form of the statement Let S P P Q Q R P P Q Q R A: P Q Q R P Q R P Q Q R Q Q R A S Minterm Maxterm T T T F F T T T
More informationSets and Motivation for Boolean algebra
SET THEORY Basic concepts Notations Subset Algebra of sets The power set Ordered pairs and Cartesian product Relations on sets Types of relations and their properties Relational matrix and the graph of
More informationII. COMBINATIONAL LOGIC DESIGN. - algebra defined on a set of 2 elements, {0, 1}, with binary operators multiply (AND), add (OR), and invert (NOT):
ENGI 386 Digital Logic II. COMBINATIONAL LOGIC DESIGN Combinational Logic output of digital system is only dependent on current inputs (i.e., no memory) (a) Boolean Algebra - developed by George Boole
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 informationPractice Test III, Math 314, Spring 2016
Practice Test III, Math 314, Spring 2016 Dr. Holmes April 26, 2016 This is the 2014 test reorganized to be more readable. I like it as a review test. The students who took this test had to do four sections
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 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 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 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 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 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 information2.2: Logical Equivalence: The Laws of Logic
Example (2.7) For primitive statement p and q, construct a truth table for each of the following compound statements. a) p q b) p q Here we see that the corresponding truth tables for two statement p q
More informationSection Summary. Relations and Functions Properties of Relations. Combining Relations
Chapter 9 Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations Closures of Relations (not currently included
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 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 informationBinary Logic and Gates
1 COE 202- Digital Logic Binary Logic and Gates Dr. Abdulaziz Y. Barnawi COE Department KFUPM 2 Outline Introduction Boolean Algebra Elements of Boolean Algebra (Binary Logic) Logic Operations & Logic
More informationBOOLEAN ALGEBRA 1. DEFINITION
9 BOOLEAN ALGEBRA 1. DEFINITION A Boolean algebra is an algebraic structure which consists of a non empty set B, equipped with two binary operations (denoted by and or + and or * and o), one unary operation
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 informationCompound Propositions
Discrete Structures Compound Propositions Producing new propositions from existing propositions. Logical Operators or Connectives 1. Not 2. And 3. Or 4. Exclusive or 5. Implication 6. Biconditional Truth
More informationCSC Discrete Math I, Spring Propositional Logic
CSC 125 - Discrete Math I, Spring 2017 Propositional Logic Propositions A proposition is a declarative sentence that is either true or false Propositional Variables A propositional variable (p, q, r, s,...)
More informationPropositional Equivalence
Propositional Equivalence Tautologies and contradictions A compound proposition that is always true, regardless of the truth values of the individual propositions involved, is called a tautology. Example:
More informationTruth-Functional Logic
Truth-Functional Logic Syntax Every atomic sentence (A, B, C, ) is a sentence and are sentences With ϕ a sentence, the negation ϕ is a sentence With ϕ and ψ sentences, the conjunction ϕ ψ is a sentence
More informationEECS150 - Digital Design Lecture 19 - Combinational Logic Circuits : A Deep Dive
EECS150 - Digital Design Lecture 19 - Combinational Logic Circuits : A Deep Dive March 30, 2010 John Wawrzynek Spring 2010 EECS150 - Lec19-cl1 Page 1 Boolean Algebra I (Representations of Combinational
More informationFundamentals of Computer Systems
Fundamentals of Computer Systems Boolean Logic Stephen A. Edwards Columbia University Fall 2011 Boolean Logic George Boole 1815 1864 Boole s Intuition Behind Boolean Logic Variables x, y,... represent
More informationBoolean algebra. Examples of these individual laws of Boolean, rules and theorems for Boolean algebra are given in the following table.
The Laws of Boolean Boolean algebra As well as the logic symbols 0 and 1 being used to represent a digital input or output, we can also use them as constants for a permanently Open or Closed circuit or
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 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 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 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 informationComputer Science Foundation Exam
Computer Science Foundation Exam August 2, 2002 Section II A DISCRETE STRUCTURES NO books, notes, or calculators may be used, and you must work entirely on your own. Name: SSN: In this section of the exam,
More informationStandard Expression Forms
ThisLecture will cover the following points: Canonical and Standard Forms MinTerms and MaxTerms Digital Logic Families 24 March 2010 Standard Expression Forms Two standard (canonical) expression forms
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 informationCS/EE 181a 2010/11 Lecture 4
CS/EE 181a 21/11 Lecture 4 General topic of today s lecture: Logic Optimization Karnaugh maps. Quine-McCluskey tabulation method (not in detail). Non series-parallel networks (some care is required). Reference
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 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 informationDiscrete Structures: Solutions to Sample Questions, Exam 2
Discrete Structures: Solutions to Sample Questions, Exam 2 1. Let A = B = {a, b, c}. Consider the relation g = {(a, b), (b, c), (c, c)}. Is g one-to-one? Is g onto? Why? Solution: g is not one-to-one,
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 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 informationCOS 140: Foundations of Computer Science
COS 140: Foundations of Computer Science Boolean Algebra Fall 2018 Introduction 3 Problem................................................................. 3 Boolean algebra...........................................................
More informationSample Problems for all sections of CMSC250, Midterm 1 Fall 2014
Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014 1. Translate each of the following English sentences into formal statements using the logical operators (,,,,, and ). You may also use mathematical
More informationCombinational Logic. Fan-in/ Fan-out Timing. Copyright (c) 2012 Sean Key
Combinational Logic Fan-in/ Fan-out Timing Copyright (c) 2012 Sean Key Fan-in & Fan-out Fan-in The number of inputs to a logic gate Higher fan-in can lead to longer gate delays because of the higher input
More informationCombinatorial Logic Design Principles
Combinatorial Logic Design Principles ECGR2181 Chapter 4 Notes Logic System Design I 4-1 Boolean algebra a.k.a. switching algebra deals with boolean values -- 0, 1 Positive-logic convention analog voltages
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 informationBoolean Algebra. Sungho Kang. Yonsei University
Boolean Algebra Sungho Kang Yonsei University Outline Set, Relations, and Functions Partial Orders Boolean Functions Don t Care Conditions Incomplete Specifications 2 Set Notation $09,3/#0,9 438 v V Element
More informationCombinational Logic Fundamentals
Topic 3: Combinational Logic Fundamentals In this note we will study combinational logic, which is the part of digital logic that uses Boolean algebra. All the concepts presented in combinational logic
More informationBoolean Algebra and Digital Logic
All modern digital computers are dependent on circuits that implement Boolean functions. We shall discuss two classes of such circuits: Combinational and Sequential. The difference between the two types
More informationLogic and Boolean algebra
Computer Mathematics Week 7 Logic and Boolean algebra College of Information Science and Engineering Ritsumeikan University last week coding theory channel coding information theory concept Hamming distance
More information2009 Spring CS211 Digital Systems & Lab CHAPTER 2: INTRODUCTION TO LOGIC CIRCUITS
CHAPTER 2: INTRODUCTION TO LOGIC CIRCUITS What will we learn? 2 Logic functions and circuits Boolean Algebra Logic gates and Synthesis CAD tools and VHDL Read Section 2.9 and 2.0 Terminology 3 Digital
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 informationSlide Set 3. for ENEL 353 Fall Steve Norman, PhD, PEng. Electrical & Computer Engineering Schulich School of Engineering University of Calgary
Slide Set 3 for ENEL 353 Fall 2016 Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary Fall Term, 2016 SN s ENEL 353 Fall 2016 Slide Set 3 slide
More informationExam 2. Is g one-to-one? Is g onto? Why? Solution: g is not one-to-one, since for c A, g(b) = g(c) = c. g is not onto, since a / g(a).
Discrete Structures: Exam 2 Solutions to Sample Questions, 1. Let A = B = {a, b, c}. Consider the relation g = {(a, b), (b, c), (c, c)}. Is g one-to-one? Is g onto? Why? Solution: g is not one-to-one,
More informationSection 1.2 Propositional Equivalences. A tautology is a proposition which is always true. A contradiction is a proposition which is always false.
Section 1.2 Propositional Equivalences A tautology is a proposition which is always true. Classic Example: P P A contradiction is a proposition which is always false. Classic Example: P P A contingency
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 informationUnit 8A Computer Organization. Boolean Logic and Gates
Unit 8A Computer Organization Boolean Logic and Gates Announcements Bring ear buds or headphones to lab! 15110 Principles of Computing, Carnegie Mellon University - CORTINA 2 Representing and Manipulating
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 informationEx: Boolean expression for majority function F = A'BC + AB'C + ABC ' + ABC.
Boolean Expression Forms: Sum-of-products (SOP) Write an AND term for each input combination that produces a 1 output. Write the input variable if its value is 1; write its complement otherwise. OR the
More informationMath Final Exam December 14, 2009 Page 1 of 5
Math 201-803-Final Exam December 14, 2009 Page 1 of 5 (3) 1. Evaluate the expressions: (a) 10 C 4 (b) 10 P 4 (c) 15!4! 3!11! (4) 2. (a) In how many ways can a president, a vice president and a treasurer
More informationChapter 2 (Lect 2) Canonical and Standard Forms. Standard Form. Other Logic Operators Logic Gates. Sum of Minterms Product of Maxterms
Chapter 2 (Lect 2) Canonical and Standard Forms Sum of Minterms Product of Maxterms Standard Form Sum of products Product of sums Other Logic Operators Logic Gates Basic and Multiple Inputs Positive and
More informationAdequate set of connectives, logic gates and circuits
Adequate set of connectives, logic gates and circuits Lila Kari University of Waterloo Adequate set of connectives, logic gates and circuits CS245, Logic and Computation 1 / 59 Connectives We have mentioned
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 informationPractice Midterm Exam Solutions
CSE 311: Foundations of Computing I Practice Midterm Exam Solutions Name: Sample Solutions ID: TA: Section: INSTRUCTIONS: You have 50 minutes to complete the exam. The exam is closed book. You may not
More informationDefinition: A binary relation R from a set A to a set B is a subset R A B. Example:
Chapter 9 1 Binary Relations Definition: A binary relation R from a set A to a set B is a subset R A B. Example: Let A = {0,1,2} and B = {a,b} {(0, a), (0, b), (1,a), (2, b)} is a relation from A to B.
More informationLATTICE AND BOOLEAN ALGEBRA
2 LATTICE AND BOOLEAN ALGEBRA This chapter presents, lattice and Boolean algebra, which are basis of switching theory. Also presented are some algebraic systems such as groups, rings, and fields. 2.1 ALGEBRA
More informationPropositional Calculus: Formula Simplification, Essential Laws, Normal Forms
P Formula Simplification, Essential Laws, Normal Forms Lila Kari University of Waterloo P Formula Simplification, Essential Laws, Normal CS245, Forms Logic and Computation 1 / 26 Propositional calculus
More informationIf f = ABC + ABC + A B C then f = AB C + A BC + AB C + A BC + A B C
Examples: If f 5 = AB + AB then f 5 = A B + A B = f 10 If f = ABC + ABC + A B C then f = AB C + A BC + AB C + A BC + A B C In terms of a truth table, if f is the sum (OR) of all the minterms with a 1 in
More informationMath 242: Principles of Analysis Fall 2016 Homework 1 Part B solutions
Math 4: Principles of Analysis Fall 0 Homework Part B solutions. Let x, y, z R. Use the axioms of the real numbers to prove the following. a) If x + y = x + z then y = z. Solution. By Axiom a), there is
More informationECE380 Digital Logic. Axioms of Boolean algebra
ECE380 Digital Logic Introduction to Logic Circuits: Boolean algebra Dr. D. J. Jackson Lecture 3-1 Axioms of Boolean algebra Boolean algebra: based on a set of rules derived from a small number of basic
More informationAxioms for the Real Number System
Axioms for the Real Number System Math 361 Fall 2003 Page 1 of 9 The Real Number System The real number system consists of four parts: 1. A set (R). We will call the elements of this set real numbers,
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 informationMore Propositional Logic Algebra: Expressive Completeness and Completeness of Equivalences. Computability and Logic
More Propositional Logic Algebra: Expressive Completeness and Completeness of Equivalences Computability and Logic Equivalences Involving Conditionals Some Important Equivalences Involving Conditionals
More informationHomework Solution #1. Chapter 2 2.6, 2.17, 2.24, 2.30, 2.39, 2.42, Grading policy is as follows: - Total 100
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)
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 information