TAILIEUCHUNG - Lecture Discrete mathematics and its applications (7/e) – Chapter 12: Boolean algebra

Lecture Discrete mathematics and its applications (7/e) – Chapter 12: Boolean algebra. This chapter presents the following content: Boolean functions, representing boolean functions, logic gates, minimization of circuits. | Boolean Algebra Chapter 12 Copyright © McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill Education. Chapter Summary Boolean Functions Representing Boolean Functions Logic Gates Minimization of Circuits (not currently included in overheads) Claude Shannon (1916 - 2001) Boolean Functions Section Section Summary Introduction to Boolean Algebra Boolean Expressions and Boolean Functions Identities of Boolean Algebra Duality The Abstract Definition of a Boolean Algebra Introduction to Boolean Algebra Boolean algebra has rules for working with elements from the set {0, 1} together with the operators + (Boolean sum), (Boolean product), and . These operators are defined by: Boolean sum: 1 + 1 = 1, 1 + 0 = 1, 0 + 1 = 1, 0 + 0 = 0 Boolean product: 1 1 = 1, 1 0 = 0, 0 1 = 0, 0 0 = 0 complement: = 1, = 0 Example: Find the value of 1 0 + Solution : 1 0 + = 0 + = 0 + 0 = 0 Boolean Expressions and Boolean Functions Definition: Let B = {0, 1}. Then Bn = {(x1, x2, , xn)

• Toán học
• Discrete mathematics
• Modeling computation
• Number theory
• Advanced counting techniques
• Boolean algebra
• Boolean functions
• Discrete mathematics applications
• Discrete Structures
• Mathematical Reasoning
• Discrete Probability
• Lecture Discrete Mathematics I
• Discrete Mathematics I
• Bài giảng Toán rời rạc
• Probability rules
• andom variables
• Probability models
• Combinatorial Analysis
• Computer Science
• Applications discrete mathematics
• The foundations
• Basic structures
• The integers