chapter_6_boolean_algebra2.pdf - CHAPTER 6 6 BOOLEAN...

Info icon This preview shows pages 1–14. Sign up to view the full content.

CHAPTER 6 BOOLEAN ALGEBRA CHAPTER 6: BOOLEAN ALGEBRA Fundamental Discrete Structure BUM1213
Image of page 1

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

CONTENT 6.1 Boolean Values 6 2 B l E i d B l F ti 6.2 Boolean Expression and Boolean Functions 6.3 Identities of Boolean Algebra 6.4 Abstract Boolean Algebra 6 5 Representing Boolean Functions 6.5 6.6 Logic Gates 6 7 Mi i i ti f Ci its 6.7 Minimization of Circuits
Image of page 2
OBJECTIVES At the end of this chapter you should be able to 6.1: Find the Boolean value of an operation 6.2: Find the values of the Boolean function 6 3: Prove the validity of Boolean Identities 6.3: Prove the validity of Boolean Identities 6.4: Define Boolean Algebra abstractly 6 5: Find the Boolean expressions that represent a 6.5: Find the Boolean expressions that represent a function 6 6: Design circuits by using NOT OR AND NAND and 6.6: Design circuits by using NOT, OR, AND, NAND, and NOR gates. 6 7: Minimize a circuit by using algebraic method and 6.7: Minimize a circuit by using algebraic method and Karnaugh maps method.
Image of page 3

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

Application Boolean Algebra is used to model the circuitry f l i d i of electronic devices.
Image of page 4