Question
Need help!!
9) DeMorgans Law: can function as an AND gate. (A + B) = A B. Use this to draw a circuit showing how 3 NOR gates 10) DeMorgans (dual) Law: (AB) = A + B. Use this to draw a circuit showing how 3 NAND gates can function as an OR gate 11) Note the following Boolean expressions for NAND gates, and use them to write the corresponding dual expressions for NOR gates a. (A0)=1 (AI)=A (AA)1 c. d.
0 0
Add a comment Improve this question Transcribed image text
Answer #1

Answer:

3 NOR ea AND A and (A+B A B A (ANDj B No R gati A B

Add a comment
Know the answer?
Add Answer to:
Need help!! 9) DeMorgan's Law: can function as an AND gate. (A + B)' = A'...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Verify that your design can be represented by the circuit below. 120 Full-Adder circuit Many of...

    Verify that your design can be represented by the circuit below. 120 Full-Adder circuit Many of the logic gates you require may not exist in standard TTL/CMOS 74 series family of logic. For example in future designs you may require a 50 input OR gate. The 74 series does not have a 50 input OR gate. For your 1 bit adder you will have the following devices: 1 quad 2 IP NAND, 1 TRIPLE 3 IP NAND, 7400 7410 7404...

  • Consider the following function. (8 <A ri eve n of products) expression. Don't draw the gate...

    Consider the following function. (8 <A ri eve n of products) expression. Don't draw the gate 1131 0 diagram yet. (b) Use De Morgan's Laws or "bubble pushing" to convert the SOP expression to something that can be directly implemented with only NAND/NOR/inverter gates. (c) Now draw the schematic (logic gates) for the resulting NAND/NOR/inverter circuit.

  • NAND and NOR gates are universal, which means that you can implement every possible Boolean function...

    NAND and NOR gates are universal, which means that you can implement every possible Boolean function with them. Remember that the NOT gate can be implemented using either a NAND or a NOR. Implement the following functions using only NAND and NOT gates. Do not simplify the functions for this problem. a. (a + b) (c' +d) b. (a'b + b'c)' Implement the following functions using only NOR and NOT gates. c. (a + ab'c)' d. (((a + b)' +...

  • We know that the NAND gate is universal, so all other gates can be built using...

    We know that the NAND gate is universal, so all other gates can be built using just NAND gates. Hence we should be able to build a half-adder using NAND gates. And we can. a) Draw the AND operation as a circuit using only 2 NAND gates b) Check your design in (a) by showing the full truth table for it c) Draw the OR operation as a circuit using only 3 NAND gates

  • 1. Determine 2 ways to implement an inverter with a 2-input NAND gate. 2. Implement a...

    1. Determine 2 ways to implement an inverter with a 2-input NAND gate. 2. Implement a 3-input NAND gate function using 2-input NAND gates only, draw schematics. 3. Implement a 2-input OR function using 2-input NAND gates only, draw schematics. 4. (A) Implement the function using one 2-input OR gate, one 2- input AND gate and one 2-input NAND gate. (B) Implement the same function with only NAND gates. (C) Make up the truth table for the function. What is...

  • We know that the NAND gate is universal, so all other gates can be built using...

    We know that the NAND gate is universal, so all other gates can be built using just NAND gates. Hence we should be able to build a half-adder using NAND gates. And we can. a) Draw the AND operation as a circuit using only 2 NAND gates [2 marks] b) Check your design in (a) by showing the full truth table for it [2 marks] c) Draw the OR operation as a circuit using only 3 NAND gates [2 marks]...

  • (1)Try to use NAND gates to achieve the truth table function of an XOR gate (2)...

    (1)Try to use NAND gates to achieve the truth table function of an XOR gate (2) Try to design a clicker for three people, it just needs two people to agree to pass.  A,B,C indicate the people, 0 means don't agree, 1 means agree. If it passes the result is 1. Please write the truth table, the SOP (sum of products) equation and draw the logic circuit for it. (3)Use a Karnaugh-map to simplify the following Boolean function: F= AB'C'+A'B'C'+AB'C+A'B'C+AB...

  • 3. () Use only NAND gates to implement the Boolean function F AC +BC. (ii) Use...

    3. () Use only NAND gates to implement the Boolean function F AC +BC. (ii) Use only NOR gates to implement the Boolean function F AB+BC. Write the truth tables and draw the logic circuits for the following Boolean functions: (i) F A +BC'. (ii) F AB +C'+D. 4.

  • 3. Implement the following gates using only one TTLİCİ (1 point) TEL EL (a) Example: One...

    3. Implement the following gates using only one TTLİCİ (1 point) TEL EL (a) Example: One 4-input OR gate (b) One 2-input NAND gate and one 2-input OR gate (c) One inverter, one 2-input NAND and one 3-input NAND (d) One 2-input XOR gate and one 2-input XNOR (e) One 4-input XNOR gate 2346 GND 2-input OR 7432 1 Porcuits Simplify the following expressions, and implement them with two-level NAND gate circuits: 4. Minterms, K-map and two-level NAND/NAND logic: F...

  • Build the truth table for half-adder and show one implementation using gates. Build a NOT gate...

    Build the truth table for half-adder and show one implementation using gates. Build a NOT gate from NOR gate. Build a NOT gate from NAND gate. Algebraic equation for XOR gate is A B bar + A bar B. Show that the algebraic equation for XNOR gate AB + A bar B bar. Draw a circuit for a 2-to-4 line decoder. 2-to-1 line multiplexer equation is given by Y = S bar I_0 + SI_1 Show an implementation of this...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT