1 / 15

Boolean Algebra

Boolean Algebra. D. W. Chathurika Pavithrani Uva Wellassa University. The digital circuitry in digital computers and other digital systems is designed, and its behavior is analyzed, with the use of mathematical discipline known as Boolean Algebra. Basic Logical Operations. AND

isaac-mendoza
Télécharger la présentation

Boolean Algebra

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Boolean Algebra D. W. ChathurikaPavithrani UvaWellassa University

  2. The digital circuitry in digital computers and other digital systems is designed, and its behavior is analyzed, with the use of mathematical discipline known as Boolean Algebra.

  3. Basic Logical Operations • AND • Represented by a dot or by the absence of an operator • OR • Represented by a Plus symbol • Not • Represented by a Bar over the variable

  4. Logical AND Operation • 0 . 0 = 0 • 0 . 1 = 0 • 1 . 0 = 0 • 1 . 1 = 1

  5. Logical OR Operation • 0 + 0 = 0 • 0 + 1 = 1 • 1 + 0 = 1 • 1 + 1 = 1

  6. D = A + (B’ + C) D equals to 1 if A is 1 or if both B = 0 and C = 1

  7. Logical XOR Operation • 0 . 0 = 0 • 0 . 1 = 1 • 1 . 0 = 1 • 1 . 1 = 0

  8. Logical NAND Operation • 0 . 0 = 1 • 0 . 1 = 1 • 1 . 0 = 1 • 1 . 1 = 0

  9. Logical NOR Operation • 0 . 0 = 1 • 0 . 1 = 0 • 1 . 0 = 0 • 1 . 1 = 0

  10. Boolean Operators

  11. A + B . C = A + (B.C) = A + BC

  12. A NAND B = NOT(A AND B) = (AB)’ A NOR B = NOT (A OR B) = (A + B)’

  13. Basic Postulates Commutative laws Distributive laws Identity elements Inverse elements

  14. Other Identities Associative Laws DeMorgan’s Theorem

  15. A NOR B = A’ AND B’ A NAND B = A’ OR B’

More Related