Chapter 10.1 and 10.2: Boolean Algebra - PowerPoint PPT Presentation

About This Presentation
Title:

Chapter 10.1 and 10.2: Boolean Algebra

Description:

Become aware of the basic properties of Boolean algebra. Two-Element Boolean Algebra ... Find the sum of products expansion of. F(x,y,z) = (x y) z'. Two approaches: ... – PowerPoint PPT presentation

Number of Views:43
Avg rating:3.0/5.0
Slides: 26
Provided by: jeffh219
Learn more at: https://cis.temple.edu
Category:

less

Transcript and Presenter's Notes

Title: Chapter 10.1 and 10.2: Boolean Algebra


1
Chapter 10.1 and 10.2 Boolean Algebra
  • Based on Slides from
  • Discrete Mathematical Structures
  • Theory and Applications

2
Learning Objectives
  • Learn about Boolean expressions
  • Become aware of the basic properties of Boolean
    algebra

3
Two-Element Boolean Algebra
Let B 0, 1.
4
Two-Element Boolean Algebra
5
(No Transcript)
6
(No Transcript)
7
(No Transcript)
8
Two-Element Boolean Algebra
9
Two-Element Boolean Algebra
10
(No Transcript)
11
(No Transcript)
12
(No Transcript)
13
(No Transcript)
14
Boolean Algebra
15
Boolean Algebra
16
(No Transcript)
17
Find a minterm that equals 1 if x1 x3 0 and
x2 x4 x5 1, and equals 0 otherwise.
x1x2x3x4x5
18
(No Transcript)
19
Therefore, the set of operators . , , is
functionally complete.
20
Sum of products expression
  • Example 3, p. 710
  • Find the sum of products expansion of
  • F(x,y,z) (x y) z
  • Two approaches
  • Use Boolean identifies
  • Use table of F values for all possible 1/0
    assignments of variables x,y,z

21
F(x,y,z) (x y) z
22
F(x,y,z) (x y) z
F(x,y,z) (x y) z xyz xyz xyz
23
(No Transcript)
24
(No Transcript)
25
Functional Completeness
The set of operators . , , is functionally
complete. Can we find a smaller set? Yes, . ,
, since x y (x . y) Can we find a set
with just one operator? Yes, NAND, NOR are
functionally complete NAND 11 0 and 10
01 00 1 NOR
NAND is functionally complete, since . , is
so and x xx xy (xy)(xy)
Write a Comment
User Comments (0)
About PowerShow.com