CONTENT6.1 Boolean Values6 2 BlEid BlFti6.2 Boolean Expression and Boolean Functions6.3 Identities of Boolean Algebra6.4 Abstract Boolean Algebra6 5 Representing Boolean Functions6.5 6.6 Logic Gates6 7 Mi iitif Ciits6.7 Minimization of Circuits
OBJECTIVESAt the end of this chapter you should be able to6.1: Find the Boolean value of an operation6.2: Find the values of the Boolean function 6 3: Prove the validity of Boolean Identities6.3: Prove the validity of Boolean Identities6.4: Define Boolean Algebra abstractly6 5: Find the Boolean expressions that represent a 6.5: Find the Boolean expressions that represent a function6 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.
has intentionally blurred sections.
Sign up to view the full version.