{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

lec7 - CSE 20 Lecture 7 Boolean Algebra CK Cheng 1 Outline...

This preview shows pages 1–9. Sign up to view the full content.

1 CSE 20: Lecture 7 Boolean Algebra CK Cheng 4/21/2011

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

View Full Document
2 Outline Introduction Definitions Interpretation in Set Operations Interpretation in Logic Operations Theorems and Proofs Multi-valued Boolean Algebra Expression Transformations
3 Introduction Boolean algebra is used in computers for arithmetic & logic operations. Eg: 1. if a is true, then y = b, else y = c. 2. y is true if a and b are true. 3. y is true if a or b is true.

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

View Full Document
4 Introduction We use binary bits to represent true or false. A=1: A is true A=0: A is false We use AND, OR, NOT gates to operate the logic. NOT gate inverts the value (flip 0 and 1) y = NOT (A)= A’ id A NOT A 0 0 1 1 1 0 A A’
5 Introduction OR gate: Output is true if either input is true y= A OR B id A B A OR B 0 0 0 0 1 0 1 1 2 1 0 1 3 1 1 1 A B A OR B

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

View Full Document
6 Introduction AND gate: Output is true only if all inputs are true y= A AND B Id A B A AND B 0 0 0 0 1 0 1 0 2 1 0 0 3 1 1 1 A B A AND B
7 Introduction A Half Adder: Carry = A AND B Sum = (A AND B’) OR (A’ AND B) Carry: A B Carry = A AND B

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

View Full Document
8
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}