elec 2200-002 digital logic circuits fall 2015 boolean algebra...
TRANSCRIPT
![Page 1: ELEC 2200-002 Digital Logic Circuits Fall 2015 Boolean Algebra …eng.auburn.edu/.../LECTURES/lec3_BooleanAlgebra.pdf · 2015-09-12 · Each postulate of Boolean algebra contains](https://reader033.vdocument.in/reader033/viewer/2022042913/5f4a0bf191bb81620f671eed/html5/thumbnails/1.jpg)
ELEC 2200-002Digital Logic Circuits
Fall 2015Boolean Algebra (Chapter 2)
Vishwani D. AgrawalJames J. Danaher Professor
Department of Electrical and Computer EngineeringAuburn University, Auburn, AL 36849http://www.eng.auburn.edu/~vagrawal
Fall 2015, Sep 14 . . . ELEC2200-002 Lecture 3 1
![Page 2: ELEC 2200-002 Digital Logic Circuits Fall 2015 Boolean Algebra …eng.auburn.edu/.../LECTURES/lec3_BooleanAlgebra.pdf · 2015-09-12 · Each postulate of Boolean algebra contains](https://reader033.vdocument.in/reader033/viewer/2022042913/5f4a0bf191bb81620f671eed/html5/thumbnails/2.jpg)
Digital Systems
Fall 2015, Sep 14 . . . ELEC2200-002 Lecture 3 2
DIGITALCIRCUITS
![Page 3: ELEC 2200-002 Digital Logic Circuits Fall 2015 Boolean Algebra …eng.auburn.edu/.../LECTURES/lec3_BooleanAlgebra.pdf · 2015-09-12 · Each postulate of Boolean algebra contains](https://reader033.vdocument.in/reader033/viewer/2022042913/5f4a0bf191bb81620f671eed/html5/thumbnails/3.jpg)
George Boole, 1815-1864Born, Lincoln, EnglandProfessor of Math., Queen’s College, Cork, IrelandBook, The Laws of Thought, 1853Wife: Mary EverestBoole
Fall 2015, Sep 14 . . . ELEC2200-002 Lecture 3 3
![Page 4: ELEC 2200-002 Digital Logic Circuits Fall 2015 Boolean Algebra …eng.auburn.edu/.../LECTURES/lec3_BooleanAlgebra.pdf · 2015-09-12 · Each postulate of Boolean algebra contains](https://reader033.vdocument.in/reader033/viewer/2022042913/5f4a0bf191bb81620f671eed/html5/thumbnails/4.jpg)
An Axiom or Postulate
A self-evident or universally recognized truth.An established rule, principle, or law.A self-evident principle or one that is accepted as true without proof as the basis for argument.A postulate – Understood as the truth.
Fall 2015, Sep 14 . . . ELEC2200-002 Lecture 3 4
![Page 5: ELEC 2200-002 Digital Logic Circuits Fall 2015 Boolean Algebra …eng.auburn.edu/.../LECTURES/lec3_BooleanAlgebra.pdf · 2015-09-12 · Each postulate of Boolean algebra contains](https://reader033.vdocument.in/reader033/viewer/2022042913/5f4a0bf191bb81620f671eed/html5/thumbnails/5.jpg)
Boolean AlgebraPostulate 1: Set and Operators
Define a set K containing two or more elements.Define two binary operators:
+, also called “OR”·, also called “AND”Such that for any pair of elements, a and b in K, a + b and a·b also belong to K
Fall 2015, Sep 14 . . . ELEC2200-002 Lecture 3 5
![Page 6: ELEC 2200-002 Digital Logic Circuits Fall 2015 Boolean Algebra …eng.auburn.edu/.../LECTURES/lec3_BooleanAlgebra.pdf · 2015-09-12 · Each postulate of Boolean algebra contains](https://reader033.vdocument.in/reader033/viewer/2022042913/5f4a0bf191bb81620f671eed/html5/thumbnails/6.jpg)
Example
a: {students in “digital circuits” course}b: {students in “computer systems” course}1: {all EE juniors}0: {null set}K: {a, b, 1, 0, a+b, a·b}Postulate 1:
a + b = 1a · b = {full-time EE students}
Fall 2015, Sep 14 . . . ELEC2200-002 Lecture 3 6
![Page 7: ELEC 2200-002 Digital Logic Circuits Fall 2015 Boolean Algebra …eng.auburn.edu/.../LECTURES/lec3_BooleanAlgebra.pdf · 2015-09-12 · Each postulate of Boolean algebra contains](https://reader033.vdocument.in/reader033/viewer/2022042913/5f4a0bf191bb81620f671eed/html5/thumbnails/7.jpg)
Postulate 2: Identity ElementsThere exist 0 and 1 elements in K, such that for every element a in K
a + 0 = aa · 1 = a
Definitions:0 is the identity element for + operation1 is the identity element for · operation
Remember, 0 and 1 here should not be misinterpreted as 0 and 1 of ordinary algebra.
Fall 2015, Sep 14 . . . ELEC2200-002 Lecture 3 7
![Page 8: ELEC 2200-002 Digital Logic Circuits Fall 2015 Boolean Algebra …eng.auburn.edu/.../LECTURES/lec3_BooleanAlgebra.pdf · 2015-09-12 · Each postulate of Boolean algebra contains](https://reader033.vdocument.in/reader033/viewer/2022042913/5f4a0bf191bb81620f671eed/html5/thumbnails/8.jpg)
Postulate 3: Commutativity
Binary operators + and · are commutative.That is, for any elements a and b in K:
a + b = b + aa · b = b · a
Example:a + b = b + a = {all EE students}a · b = b · a = {all full-time EE students}
Fall 2015, Sep 14 . . . ELEC2200-002 Lecture 3 8
![Page 9: ELEC 2200-002 Digital Logic Circuits Fall 2015 Boolean Algebra …eng.auburn.edu/.../LECTURES/lec3_BooleanAlgebra.pdf · 2015-09-12 · Each postulate of Boolean algebra contains](https://reader033.vdocument.in/reader033/viewer/2022042913/5f4a0bf191bb81620f671eed/html5/thumbnails/9.jpg)
Postulate 4: AssociativityBinary operators + and · are associative.That is, for any elements a, b and c in K:
a + (b + c) = (a + b) + ca · (b · c) = (a · b) · c
Example: EE department has three courses with student groups a, b and c
Fall 2015, Sep 14 . . . ELEC2200-002 Lecture 3 9
All EE students: a + (b + c)
a
b
c a c
b
EE students in all EE courses: a · (b · c)
![Page 10: ELEC 2200-002 Digital Logic Circuits Fall 2015 Boolean Algebra …eng.auburn.edu/.../LECTURES/lec3_BooleanAlgebra.pdf · 2015-09-12 · Each postulate of Boolean algebra contains](https://reader033.vdocument.in/reader033/viewer/2022042913/5f4a0bf191bb81620f671eed/html5/thumbnails/10.jpg)
Postulate 5: Distributivity
Binary operator + is distributive over · and · is distributive over +.That is, for any elements a, b and c in K:
a + (b · c) = (a + b) · (a + c)a · (b + c) = (a · b) + (a · c)
Remember dot (·) operation is performed before + operation:
a + b · c = a + ( b · c) ≠ (a + b) · c
Fall 2015, Sep 14 . . . ELEC2200-002 Lecture 3 10
![Page 11: ELEC 2200-002 Digital Logic Circuits Fall 2015 Boolean Algebra …eng.auburn.edu/.../LECTURES/lec3_BooleanAlgebra.pdf · 2015-09-12 · Each postulate of Boolean algebra contains](https://reader033.vdocument.in/reader033/viewer/2022042913/5f4a0bf191bb81620f671eed/html5/thumbnails/11.jpg)
Postulate 6: ComplementA unary operation, complementation, exists for every element of K.That is, for any element a in K:
Where, 1 is identity element for ·0 is identity element for +
Fall 2015, Sep 14 . . . ELEC2200-002 Lecture 3 11
0aa1aa
=⋅
=+
![Page 12: ELEC 2200-002 Digital Logic Circuits Fall 2015 Boolean Algebra …eng.auburn.edu/.../LECTURES/lec3_BooleanAlgebra.pdf · 2015-09-12 · Each postulate of Boolean algebra contains](https://reader033.vdocument.in/reader033/viewer/2022042913/5f4a0bf191bb81620f671eed/html5/thumbnails/12.jpg)
ExampleA set contains four elements:
x = {φ}, null set y = {1, 2}z = {3, 4, 5} w = {1, 2, 3, 4, 5}
Define two operations: union (+) and intersection (·):
+ x y z wx x y z w
y y y w w
z z w z w
w w w w w
· x y z wx x x x xy x y x yz x x z zw x y z w
Fall 2015, Sep 14 . . . ELEC2200-002 Lecture 3 12
![Page 13: ELEC 2200-002 Digital Logic Circuits Fall 2015 Boolean Algebra …eng.auburn.edu/.../LECTURES/lec3_BooleanAlgebra.pdf · 2015-09-12 · Each postulate of Boolean algebra contains](https://reader033.vdocument.in/reader033/viewer/2022042913/5f4a0bf191bb81620f671eed/html5/thumbnails/13.jpg)
Verify Postulates 1, 2 and 31. Union and intersection, used as binary
operators on a pair of elements, produce a result within the same set.
2. Identity elements are x for union (+) and w for intersection (·). x ≡ 0; w ≡ 1.
3. Commutativity is verified from the symmetry in the function tables for the two operators
Fall 2015, Sep 14 . . . ELEC2200-002 Lecture 3 13
![Page 14: ELEC 2200-002 Digital Logic Circuits Fall 2015 Boolean Algebra …eng.auburn.edu/.../LECTURES/lec3_BooleanAlgebra.pdf · 2015-09-12 · Each postulate of Boolean algebra contains](https://reader033.vdocument.in/reader033/viewer/2022042913/5f4a0bf191bb81620f671eed/html5/thumbnails/14.jpg)
Postulate 4: AssociativityExamine the Venn diagram. For any group of elements, intersections or unions in any order lead to the same result.
Fall 2015, Sep 14 . . . ELEC2200-002 Lecture 3 14
φ 1, 2
3, 4, 5
xy
z
w
![Page 15: ELEC 2200-002 Digital Logic Circuits Fall 2015 Boolean Algebra …eng.auburn.edu/.../LECTURES/lec3_BooleanAlgebra.pdf · 2015-09-12 · Each postulate of Boolean algebra contains](https://reader033.vdocument.in/reader033/viewer/2022042913/5f4a0bf191bb81620f671eed/html5/thumbnails/15.jpg)
Postulate 5: DistributivityTo verify distributivity, examine the Venn diagram for distributivity over union and intersection.
Fall 2015, Sep 14 . . . ELEC2200-002 Lecture 3 15
φ 1, 2
3, 4, 5
x
y
z
w
![Page 16: ELEC 2200-002 Digital Logic Circuits Fall 2015 Boolean Algebra …eng.auburn.edu/.../LECTURES/lec3_BooleanAlgebra.pdf · 2015-09-12 · Each postulate of Boolean algebra contains](https://reader033.vdocument.in/reader033/viewer/2022042913/5f4a0bf191bb81620f671eed/html5/thumbnails/16.jpg)
Postulate 6: ComplementsAny element + its complement = Identity for ·Any element · Its complement = Identity for +Verifiable from Venn diagram.
Fall 2015, Sep 14 . . . ELEC2200-002 Lecture 3 16
φ 1, 2
3, 4, 5
x
y
z
wIdentityElementFor +
IdentityElementFor ·
![Page 17: ELEC 2200-002 Digital Logic Circuits Fall 2015 Boolean Algebra …eng.auburn.edu/.../LECTURES/lec3_BooleanAlgebra.pdf · 2015-09-12 · Each postulate of Boolean algebra contains](https://reader033.vdocument.in/reader033/viewer/2022042913/5f4a0bf191bb81620f671eed/html5/thumbnails/17.jpg)
Conclusion
Because all six postulates are true for our example, it is a Boolean algebra.
Fall 2015, Sep 14 . . . ELEC2200-002 Lecture 3 17
![Page 18: ELEC 2200-002 Digital Logic Circuits Fall 2015 Boolean Algebra …eng.auburn.edu/.../LECTURES/lec3_BooleanAlgebra.pdf · 2015-09-12 · Each postulate of Boolean algebra contains](https://reader033.vdocument.in/reader033/viewer/2022042913/5f4a0bf191bb81620f671eed/html5/thumbnails/18.jpg)
The Duality Principle
Each postulate of Boolean algebra contains a pair of expressions or equations such that one is transformed into the other and vice-versa by interchanging the operators, + ↔ ·, and identity elements, 0 ↔ 1.The two expressions are called the duals of each other.
Fall 2015, Sep 14 . . . ELEC2200-002 Lecture 3 18
![Page 19: ELEC 2200-002 Digital Logic Circuits Fall 2015 Boolean Algebra …eng.auburn.edu/.../LECTURES/lec3_BooleanAlgebra.pdf · 2015-09-12 · Each postulate of Boolean algebra contains](https://reader033.vdocument.in/reader033/viewer/2022042913/5f4a0bf191bb81620f671eed/html5/thumbnails/19.jpg)
Examples of Duals
PostulateDuals
Expression 1 Expression 21 a, b, a + b ε K a, b, a · b ε K2 a + 0 = a a · 1 = a3 a + b = b + a a · b = b · a4 a + (b + c) = (a + b) + c a · (b · c) = (a · b) · c5 a + (b · c)=(a + b) · (a + c) a · (b + c)=(a · b)+(a · c)
6
Fall 2015, Sep 14 . . . ELEC2200-002 Lecture 3 19
1aa =+ 0aa =•
![Page 20: ELEC 2200-002 Digital Logic Circuits Fall 2015 Boolean Algebra …eng.auburn.edu/.../LECTURES/lec3_BooleanAlgebra.pdf · 2015-09-12 · Each postulate of Boolean algebra contains](https://reader033.vdocument.in/reader033/viewer/2022042913/5f4a0bf191bb81620f671eed/html5/thumbnails/20.jpg)
Examples of Duals
Fall 2015, Sep 14 . . . ELEC2200-002 Lecture 3 20
Expressions: A · B A + B
Equations:duals
A + (BC) = (A+B)(A+C) ↔ A (B+C) = AB + AC
Note: A · B is also written as AB.
A B A B
![Page 21: ELEC 2200-002 Digital Logic Circuits Fall 2015 Boolean Algebra …eng.auburn.edu/.../LECTURES/lec3_BooleanAlgebra.pdf · 2015-09-12 · Each postulate of Boolean algebra contains](https://reader033.vdocument.in/reader033/viewer/2022042913/5f4a0bf191bb81620f671eed/html5/thumbnails/21.jpg)
Properties of Boolean Algebra
Properties stated as theorems.Provable from the postulates (axioms) of Boolean algebra.
Fall 2015, Sep 14 . . . ELEC2200-002 Lecture 3 21
![Page 22: ELEC 2200-002 Digital Logic Circuits Fall 2015 Boolean Algebra …eng.auburn.edu/.../LECTURES/lec3_BooleanAlgebra.pdf · 2015-09-12 · Each postulate of Boolean algebra contains](https://reader033.vdocument.in/reader033/viewer/2022042913/5f4a0bf191bb81620f671eed/html5/thumbnails/22.jpg)
Theorem 1: Idempotency (Invariance)
For all elements a in K: a + a = a; a a = a.Proof:a + a = (a + a)1, (identity element)
= (a + a)(a + ā), (complement)= a + a ā, (distributivity)= a + 0, (complement)= a, (identity element)
Fall 2015, Sep 14 . . . ELEC2200-002 Lecture 3 22
![Page 23: ELEC 2200-002 Digital Logic Circuits Fall 2015 Boolean Algebra …eng.auburn.edu/.../LECTURES/lec3_BooleanAlgebra.pdf · 2015-09-12 · Each postulate of Boolean algebra contains](https://reader033.vdocument.in/reader033/viewer/2022042913/5f4a0bf191bb81620f671eed/html5/thumbnails/23.jpg)
Theorem 1: Idempotency
For all elements a in K: a + a = a; a a = a.Proof:a a = (a a) + 0, (identity element)
= (a a) + (a ā), (complement)= a (a + ā), (distributivity)= a 1, (complement)= a, (identity element)
Fall 2015, Sep 14 . . . ELEC2200-002 Lecture 3 23
![Page 24: ELEC 2200-002 Digital Logic Circuits Fall 2015 Boolean Algebra …eng.auburn.edu/.../LECTURES/lec3_BooleanAlgebra.pdf · 2015-09-12 · Each postulate of Boolean algebra contains](https://reader033.vdocument.in/reader033/viewer/2022042913/5f4a0bf191bb81620f671eed/html5/thumbnails/24.jpg)
Theorem 2: Null Elements Exista + 1 = 1, for + operator.a · 0 = 0, for · operator.Proof: a + 1 = (a + 1)1, (identity element)
= 1(a + 1), (commutativity)= (a + ā)(a + 1), (complement)= a + ā 1, (distributivity)= a + ā, (identity element)= 1, (complement)
Similar proof for a 0 = 0.Fall 2015, Sep 14 . . . ELEC2200-002 Lecture 3 24
![Page 25: ELEC 2200-002 Digital Logic Circuits Fall 2015 Boolean Algebra …eng.auburn.edu/.../LECTURES/lec3_BooleanAlgebra.pdf · 2015-09-12 · Each postulate of Boolean algebra contains](https://reader033.vdocument.in/reader033/viewer/2022042913/5f4a0bf191bb81620f671eed/html5/thumbnails/25.jpg)
Theorem 2: Null Elements Exista + 1 = 1, for + operator.a · 0 = 0, for · operator.Proof: a + 1 = (a + 1)1, (identity element)
= 1(a + 1), (commutativity)= (a + ā)(a + 1), (complement)= a + ā 1, (distributivity)= a + ā, (identity element)= 1, (complement)
Similar proof for a 0 = 0.Fall 2015, Sep 14 . . . ELEC2200-002 Lecture 3 25
![Page 26: ELEC 2200-002 Digital Logic Circuits Fall 2015 Boolean Algebra …eng.auburn.edu/.../LECTURES/lec3_BooleanAlgebra.pdf · 2015-09-12 · Each postulate of Boolean algebra contains](https://reader033.vdocument.in/reader033/viewer/2022042913/5f4a0bf191bb81620f671eed/html5/thumbnails/26.jpg)
Theorem 2: Null Elements Exista + 1 = 1, for + operator.a · 0 = 0, for · operator.Proof: a 0 = (a 0) + 0, (identity element)
= 0 + (a 0), (commutativity)= (a ā) + (a 0), (complement)= a(ā + 0), (distributivity)= a ā, (identity element)= 0, (complement)
Fall 2015, Sep 14 . . . ELEC2200-002 Lecture 3 26
![Page 27: ELEC 2200-002 Digital Logic Circuits Fall 2015 Boolean Algebra …eng.auburn.edu/.../LECTURES/lec3_BooleanAlgebra.pdf · 2015-09-12 · Each postulate of Boolean algebra contains](https://reader033.vdocument.in/reader033/viewer/2022042913/5f4a0bf191bb81620f671eed/html5/thumbnails/27.jpg)
Theorem 3: Involution Holds
a = aProof: a + ā = 1 and a ā = 0, (complements)
or ā + a = 1 and ā a = 0, (commutativity)i.e., a is complement of āTherefore, a = a
Fall 2015, Sep 14 . . . ELEC2200-002 Lecture 3 27
=
=
![Page 28: ELEC 2200-002 Digital Logic Circuits Fall 2015 Boolean Algebra …eng.auburn.edu/.../LECTURES/lec3_BooleanAlgebra.pdf · 2015-09-12 · Each postulate of Boolean algebra contains](https://reader033.vdocument.in/reader033/viewer/2022042913/5f4a0bf191bb81620f671eed/html5/thumbnails/28.jpg)
Theorem 4: Absorption
a + a b = aa (a + b) = aProof: a + a b = a 1 + a b, (identity element)
= a(1 + b), (distributivity)= a 1, (Theorem 2)= a, (identity element)
Similar proof for a (a + b) = a.Fall 2015, Sep 14 . . . ELEC2200-002 Lecture 3 28
![Page 29: ELEC 2200-002 Digital Logic Circuits Fall 2015 Boolean Algebra …eng.auburn.edu/.../LECTURES/lec3_BooleanAlgebra.pdf · 2015-09-12 · Each postulate of Boolean algebra contains](https://reader033.vdocument.in/reader033/viewer/2022042913/5f4a0bf191bb81620f671eed/html5/thumbnails/29.jpg)
Theorems 5, 6 and 7 (p. 86-87)Theorem 5:
Theorem 6:
Theorem 7:
Fall 2015, Sep 14 . . . ELEC2200-002 Lecture 3 29
c)b)(a(a c)b b)(a (aac ab c ba ab
++=++++=+
a)bb)(a(aabaab
=++
=+
abb)aa(babaa
=+
+=+
![Page 30: ELEC 2200-002 Digital Logic Circuits Fall 2015 Boolean Algebra …eng.auburn.edu/.../LECTURES/lec3_BooleanAlgebra.pdf · 2015-09-12 · Each postulate of Boolean algebra contains](https://reader033.vdocument.in/reader033/viewer/2022042913/5f4a0bf191bb81620f671eed/html5/thumbnails/30.jpg)
Proving Theorem 5
Fall 2015, Sep 14 . . . ELEC2200-002 Lecture 3 30
abb)aa(babaa
=+
+=+
a b
Using Venn diagram
![Page 31: ELEC 2200-002 Digital Logic Circuits Fall 2015 Boolean Algebra …eng.auburn.edu/.../LECTURES/lec3_BooleanAlgebra.pdf · 2015-09-12 · Each postulate of Boolean algebra contains](https://reader033.vdocument.in/reader033/viewer/2022042913/5f4a0bf191bb81620f671eed/html5/thumbnails/31.jpg)
Theorem 8: DeMorgan’s Theorem
Fall 2015, Sep 14 . . . ELEC2200-002 Lecture 3 31
88 page see proof, for 88 page see proof, for
,baba ,baba
+=⋅
⋅=+
zbazbazbazba
+++=⋅
⋅=+++
Generalization of DeMorgan’s Theorem:
![Page 32: ELEC 2200-002 Digital Logic Circuits Fall 2015 Boolean Algebra …eng.auburn.edu/.../LECTURES/lec3_BooleanAlgebra.pdf · 2015-09-12 · Each postulate of Boolean algebra contains](https://reader033.vdocument.in/reader033/viewer/2022042913/5f4a0bf191bb81620f671eed/html5/thumbnails/32.jpg)
Martians and VenusiansSuppose Martians are blue and Venusians are pink.An Earthling identifying itself: “I am not blue or pink.”
blue + pink = blue · pinkMeaning: “I am not blue and I am not pink.”Or: “I am not a Martian and I am not a Venusian.”
Fall 2015, Sep 14 . . . ELEC2200-002 Lecture 3 32
![Page 33: ELEC 2200-002 Digital Logic Circuits Fall 2015 Boolean Algebra …eng.auburn.edu/.../LECTURES/lec3_BooleanAlgebra.pdf · 2015-09-12 · Each postulate of Boolean algebra contains](https://reader033.vdocument.in/reader033/viewer/2022042913/5f4a0bf191bb81620f671eed/html5/thumbnails/33.jpg)
Tall, Dark and Handsome“He did not appear to be tall, dark and handsome.”
tall · dark · handsome = tall + dark + handsomeMeaning: “He was not tall or he was not dark or he was not handsome.”Equivalently: “He was short or he was pale or he was ugly.”Perhaps, not the fellow we were looking for.
Fall 2015, Sep 14 . . . ELEC2200-002 Lecture 3 33
![Page 34: ELEC 2200-002 Digital Logic Circuits Fall 2015 Boolean Algebra …eng.auburn.edu/.../LECTURES/lec3_BooleanAlgebra.pdf · 2015-09-12 · Each postulate of Boolean algebra contains](https://reader033.vdocument.in/reader033/viewer/2022042913/5f4a0bf191bb81620f671eed/html5/thumbnails/34.jpg)
Theorem 9: Consensus
Fall 2015, Sep 14 . . . ELEC2200-002 Lecture 3 34
c)ab)((ac)c)(bab)((acaabbccaab
++=+++
+=++
a
b
c
ab
āc
See page 90.First case for union and intersection:
bc
![Page 35: ELEC 2200-002 Digital Logic Circuits Fall 2015 Boolean Algebra …eng.auburn.edu/.../LECTURES/lec3_BooleanAlgebra.pdf · 2015-09-12 · Each postulate of Boolean algebra contains](https://reader033.vdocument.in/reader033/viewer/2022042913/5f4a0bf191bb81620f671eed/html5/thumbnails/35.jpg)
Next, Switching Algebra
Set K contains two elements, {0, 1}, also called {false, true}, or {off, on}, etc.Two operations are defined as, + ≡ OR, · ≡ AND.
Fall 2015, Sep 14 . . . ELEC2200-002 Lecture 3 35
+ 0 1
0 0 1
1 1 1
· 0 1
0 0 0
1 0 1