CSE20 Lecture 7

# CSE20 Lecture 7 - CSE 20: Lecture 7 Boolean Algebra CK...

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

1 CSE 20: Lecture 7 Boolean Algebra CK Cheng 2/4/2010

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

View Full Document
Outlines • Introduction • Definitions • Interpretation in Set Operations • Interpretation in Logic Operations • Theorems and Proofs • Multi-valued Boolean Algebra • Expression Transformations 2
3 1. Introduction Boolean algebra is used in computers for arithmetic & logic operations. Eg: if a = 1, then y = b, else y = c. a and b values that pass through AND gates return true if and only if both a and b are true. AND Gate id a b c 0 0 0 0 1 0 1 0 2 1 0 0 3 1 1 1 a b D c

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

View Full Document
4 OR & Inverter a and b feed into OR gates. The output is true if either a or b is true. Output c is the complement of a. OR Gate id a b c 0 0 0 0 1 0 1 1 2 1 0 1 3 1 1 1 Inverter a c 0 1 1 0 a b c a c
5 A Half Adder: a sum D carry b a D b a D b

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

View Full Document
6 2. Definitions • Boolean Algebra: A set of elements B with two operations • + (V, , OR) • * ( ʌ , , AND) satisfying the following 4 laws: • P1: Commutative Laws: a+b = b+a, a*b = b*a. • P2:
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 06/12/2011 for the course CS 1 taught by Professor Staff during the Fall '08 term at Cornell University (Engineering School).

### Page1 / 13

CSE20 Lecture 7 - CSE 20: Lecture 7 Boolean Algebra CK...

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

View Full Document
Ask a homework question - tutors are online