CMPUT329 - Fall 2003
Reading Assignment
What is a switching network?
Logic Functions: Boolean Algebra
Boolean expressions and logic circuits
Basic Theorems: Operations with 0 and 1
Basic Theorems: Idempotent Laws
Basic Theorems: Involution Law
Basic Theorems: Laws of Complementarity
Expression Simplification using the Basic Theorems
Associative Law
First Distributive Law
Second Distributive Law
Second Distributive Law (A different proof)
Simplification Theorems
Examples
Email: amaral@cs.ualberta.ca
Home Page: www.cs.ualberta.ca/~amaral/courses/329
Download presentation source