Boolean Algebra and Logic Design

Boolean Algebra and Logic Design - Notes on Boolean Algebra...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Notes on Boolean Algebra and Logic Design All variables have the values 1 or 0 sometimes we call the values TRUE / FALSE Three operators: OR written as + , as in A + B AND written as , as in A B NOT indicated by an overline or a prime, as in A Operator OR The result of the OR operator is 1 if either of the operands is a 1. The only time the result of an OR is 0 is when both operands are 0s. OR is sort of like addition, but operates only on binary values. Operator AND The result of an AND is a 1 only when both operands are 1s. If either operand is a 0, the result is 0. AND is sort of like multiplication, but operates on binary values. Operator NOT NOT is a unary operator – it operates on only one operand. NOT negates it’s operand. If the operand is a 1, the result of the NOT is a 0. Equations Boolean algebra uses equations to express relationships. For example: This equation expresses a relationship between the value of X and the values of A, B and C. Laws of Boolean Algebra
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 08/22/2010 for the course CDA 3101 taught by Professor Staff during the Fall '07 term at University of Central Florida.

Page1 / 9

Boolean Algebra and Logic Design - Notes on Boolean Algebra...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online