Unformatted text preview: + a b c d . a b c d a a a a a a a b c d b a b b a b b b c c c a b c d c c c c c d a a d d d d c c d For problems 6 and 7, use Boolean algebra postulates and theorems. Supply reasons for each step. Use postulate and theorem numbers from lecture #3 notation. (15p) 6. Simplify the following expressions into a minimum sum of products: (a) 5p (((x+y)’+z)’w)’ (b) 5p (a+b)’cd’+a+b (c) 5p ((a+b)’+c’d)’ (15p) 7. Simplify each of the following expressions into a minimum product of sum form: (a) 5p ab+abc’+ac’d (b) 5p a+bc+def (c) 5p ab + bc + ac...
View
Full Document
 Spring '08
 M
 Logic, Boolean Algebra

Click to edit the document details