DOC PREVIEW
SJSU
CS 147 -
Practice Exercise 2
View full document
Premium Document
Do you want full access? Go Premium and unlock all 2 pages.
Access to all documents
Download any document
Ad free experience
Unformatted text preview:
View Full Document
Practice Exercise 21. Simplify following Boolean Functions:a) F = xy + x’y + xy’b) F = x + x’yc) F = (x + y)(x +y’)d) F = xy + x’z + yze) F = xyz + x’y + xyz’2. What does the circuit in Figure 1 do? Figure 1: Truth-table (a) and circuit (b) for majority of three circuit3.What is Exclusive or function? Implement it with only Nand gates.Figure2.: Exclusive or - three implementationsImplement it with only Nor gates.4. Prove that by truth table.5. How would you use two xors, two inverter/nots, and an and to create a circuit to compare two two-bit
View Full Document
Unlocking...