Question

Part III (may be done in CircuitMaker) Y=AB \overline{(CD)} +BCD+ (A+C) (B+D) • For the above Boolean Expression reduce by one step (just break the bar over (C'D)) using DeMorgan's Theorem on it. ? Draw a logic Diagram of the expression after reducing by the one step. ? Create the circuit using TTL chips or you may simulate this with CircuitMaker. ? Create a truth table and verify the outputs of the circuit. • If possible, reduce this circuit further. ? Show your work for the Boolean Reduction. ? Draw a logic Diagram of the expression ? Verify your new reduced circuit matches your truth table from the circuit the one you created above. • Write this up formally on your Lab Report ? Include the logic diagrams and truth table(s) ? Show all you work (neatly) for the reduction. ? Include the rule numbers for your steps of reduction

          Part III (may be done in CircuitMaker)
Y=AB \overline{(CD)} +BCD+ (A+C) (B+D)
• For the above Boolean Expression reduce by one step (just break the bar over
(C'D)) using DeMorgan's Theorem on it.
? Draw a logic Diagram of the expression after reducing by the one step.
? Create the circuit using TTL chips or you may simulate this with
CircuitMaker.
? Create a truth table and verify the outputs of the circuit.
• If possible, reduce this circuit further.
? Show your work for the Boolean Reduction.
? Draw a logic Diagram of the expression
? Verify your new reduced circuit matches your truth table from the
circuit the one you created above.
• Write this up formally on your Lab Report
? Include the logic diagrams and truth table(s)
? Show all you work (neatly) for the reduction.
? Include the rule numbers for your steps of reduction

Part III (may be done in CircuitMaker)
Y=AB (CD) +BCD+ (A+C) (B+D)
• For the above Boolean Expression reduce by one step (just break the bar over
(C'D)) using DeMorgan's Theorem on it.
? Draw a logic Diagram of the expression after reducing by the one step.
? Create the circuit using TTL chips or you may simulate this with
CircuitMaker.
? Create a truth table and verify the outputs of the circuit.
• If possible, reduce this circuit further.
? Show your work for the Boolean Reduction.
? Draw a logic Diagram of the expression
? Verify your new reduced circuit matches your truth table from the
circuit the one you created above.
• Write this up formally on your Lab Report
? Include the logic diagrams and truth table(s)
? Show all you work (neatly) for the reduction.
? Include the rule numbers for your steps of reduction

Added by Tara S.

Question

Please give Ace some feedback