CS 230 – Introduction to Computers and Computer Systems Lecture 2 – Boolean Algebra and Circuits CS 230 - Spring 2020 1-1
Boolean Algebra Algebra to express binary logic Basic operators: OR, AND, NOT More advanced operators later Like normal elementary algebra OR – similar to addition AND – similar to multiplication NOT – similar to negation identity, inverse, commutative, associative, etc. CS 230 - Spring 2020 1-2
Boolean OR CS 230 - Spring 2020 1-3
Boolean OR CS 230 - Spring 2020 1-4
Boolean OR CS 230 - Spring 2020 1-5
Boolean OR CS 230 - Spring 2020 1-6
Boolean AND CS 230 - Spring 2020 1-7
Boolean NOT CS 230 - Spring 2020 1-8
CS 230 - Spring 2020 1-9
CS 230 - Spring 2020 1-10
CS 230 - Spring 2020 1-11
CS 230 - Spring 2020 1-12
CS 230 - Spring 2020 1-13
CS 230 - Spring 2020 1-14
CS 230 - Spring 2020 1-15
CS 230 - Spring 2020 1-16
CS 230 - Spring 2020 1-17
CS 230 - Spring 2020 1-18
CS 230 - Spring 2020 1-19
CS 230 - Spring 2020 1-20
CS 230 - Spring 2020 1-21
CS 230 - Spring 2020 1-22
Boolean NAND ¬ (X ∧ Y) CS 230 - Spring 2020 1-23
Boolean NOR ¬ (X ∨ Y) CS 230 - Spring 2020 1-24
Boolean XOR (X ∧ ¬Y) ∨ (¬X ∧ Y) CS 230 - Spring 2020 1-25
Boolean XNOR (X ∧ Y) ∨ (¬X ∧ ¬Y) CS 230 - Spring 2020 1-26
Precedence Boolean operators have precedence Just like regular algebra Order is (from highest to lowest) NOT > AND=NAND > XOR=XNOR > OR=NOR Equal precedence are evaluated left-to-right Parenthesis override precedence Just like regular algebra CS 230 - Spring 2020 1-27
CS 230 - Spring 2020 1-28
CS 230 - Spring 2020 1-29
CS 230 - Spring 2020 1-30
CS 230 - Spring 2020 1-31
CS 230 - Spring 2020 1-32
CS 230 - Spring 2020 1-33
CS 230 - Spring 2020 1-34
CS 230 - Spring 2020 1-35
CS 230 - Spring 2020 1-36
CS 230 - Spring 2020 1-37
CS 230 - Spring 2020 1-38
CS 230 - Spring 2020 1-39
CS 230 - Spring 2020 1-40
CS 230 - Spring 2020 1-41
CS 230 - Spring 2020 1-42
CS 230 - Spring 2020 1-43
CS 230 - Spring 2020 1-44
CS 230 - Spring 2020 1-45
CS 230 - Spring 2020 1-46
CS 230 - Spring 2020 1-47
CS 230 - Spring 2020 1-48
CS 230 - Spring 2020 1-49
CS 230 - Spring 2020 1-50
CS 230 - Spring 2020 1-51
CS 230 - Spring 2020 1-52
Boolean Algebra Rules Identities Annihilators A ∨ 0 = A A ∨ 1 = 1 A ∧ 1 = A A ∧ 0 = 0 A ∨ A = A Complements A ∧ A = A A ∨ ¬A = 1 A ∧ ¬A = 0 Involution ¬¬A = A CS 230 - Spring 2020 1-53
More Rules Commutative Law A ∨ B = B ∨ A A ∧ B = B ∧ A Associative Law A ∨ (B ∨ C) = (A ∨ B) ∨ C A ∧ (B ∧ C) = (A ∧ B) ∧ C CS 230 - Spring 2020 1-54
Even More Rules Distributive Law A ∧ (B ∨ C) = A ∧ B ∨ A ∧ C A ∨ (B ∧ C) = (A ∨ B) ∧ (A ∨ C) De Morgan's Law ¬(A ∨ B) = ¬A ∧ ¬B ¬(A ∧ B) = ¬A ∨ ¬B CS 230 - Spring 2020 1-55
CS 230 - Spring 2020 1-56
CS 230 - Spring 2020 1-57
CS 230 - Spring 2020 1-58
CS 230 - Spring 2020 1-59
CS 230 - Spring 2020 1-60
CS 230 - Spring 2020 1-61
CS 230 - Spring 2020 1-62
CS 230 - Spring 2020 1-63
CS 230 - Spring 2020 1-64
CS 230 - Spring 2020 1-65
CS 230 - Spring 2020 1-66
CS 230 - Spring 2020 1-67
CS 230 - Spring 2020 1-68
CS 230 - Spring 2020 1-69
CS 230 - Spring 2020 1-70
CS 230 - Spring 2020 1-71
CS 230 - Spring 2020 1-72
CS 230 - Spring 2020 1-73
CS 230 - Spring 2020 1-74
CS 230 - Spring 2020 1-75
Digital Electronic Circuits Boolean algebra models electronic circuits Each operation has a corresponding gate A physical circuit component that applies a Boolean operator AND NAND XOR OR NOR XNOR NOT CS 230 - Spring 2020 1-76
CS 230 - Spring 2020 1-77
CS 230 - Spring 2020 1-78
CS 230 - Spring 2020 1-79
CS 230 - Spring 2020 1-80
CS 230 - Spring 2020 1-81
CS 230 - Spring 2020 1-82
CS 230 - Spring 2020 1-83
CS 230 - Spring 2020 1-84
CS 230 - Spring 2020 1-85
CS 230 - Spring 2020 1-86
CS 230 - Spring 2020 1-87
CS 230 - Spring 2020 1-88
CS 230 - Spring 2020 1-89
CS 230 - Spring 2020 1-90
CS 230 - Spring 2020 1-91
CS 230 - Spring 2020 1-92
CS 230 - Spring 2020 1-93
CS 230 - Spring 2020 1-94
CS 230 - Spring 2020 1-95
CS 230 - Spring 2020 1-96
CS 230 - Spring 2020 1-97
CS 230 - Spring 2020 1-98
CS 230 - Spring 2020 1-99
CS 230 - Spring 2020 1-100
Recommend
More recommend