Unformatted text preview: n = 2. 8. Boolean Algebra: State and prove DeMorgan’s laws. 9. Boolean Algebra: Show the operation tables for a Boolean algebra of four ele-ments. 10. Boolean Algebra: Simplify formula ( pq + r )( p + r )( q + r ). 11. Boolean Algebra: Express Boolean function E ( x, y, z ) = ( x + y )( xy ) ( x + y + z ) in sum-of-products form. 12. Boolean Algebra: Express Boolean function E ( x, y, z ) = xy + ( x + z ) + x y z in product-of-sums form. 13. Boolean Algebra: Prove or disprove the Boolean equation, ( a b + c )( a + b )( b + ac ) = a bc . 14. Boolean Algebra: Reduce the following to an expression of a minimal number of literals (4). abc d + ab c + bc d + ab c + acd + a bcd . 1...
View
Full Document
- Fall '08
- STAFF
- Boolean Algebra, Boolean function, Boolean-valued function
-
Click to edit the document details