Unformatted text preview: equations. (a) x’y’+xy=(xy’+x’y)’ (b) x’z+xy=x’y’z+yz+xy. 3. Page 119 of textbook, 3.7 (a). Derive the sum-of-minterms and the product-of-maxterms canonical forms for (a) F=x ⊕ y ⊕ z 4. Page 119 of textbook, 3.10 (a) and (b). Minimize the number of operators in the following Boolean expressions. (a) x’y’+xy+xy’ (b) (x+y)(x+y’) Hint for 3: ' ' xy y x y x + = ⊕ , and then you treat x’y+xy’ as one variable (e.g. w), do w XOR z again, then replace each w with (x’y+xy’). If you still have questions, come to see me during office hour or other time by appointment....
View Full Document
- Spring '08
- Computer Architecture, Boolean Algebra, Boolean function, Logical connective, algebraic manipulation