ZuoTi.Pro
Question

(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

Also write the truth table and draw the logic circuit for it.

I want the three exercises please

engineering   Electrical-Engineering   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1

0 0
Add a comment
Know the answer?
Add Answer to:
(1)Try to use NAND gates to achieve the truth table function of an XOR gate (2)...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

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

  • X 1. Determine the truth table for the above circuit. A B C 0 0 0...

    X 1. Determine the truth table for the above circuit. A B C 0 0 0 0 0 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 111 2. Determine the Karnaugh Map for the above circuit and do both an SOP minimization (the left KAI) and a POS minimization (the right KM). Write the minimized Boolean expressions below the corresponding Karnaugh Map BC ВС 00 01 11 10 00 01 11 10 0...

  • Write out the truth table for the expression (A and B)xor (C or D). A NAND...

    Write out the truth table for the expression (A and B)xor (C or D). A NAND is the combination of two other basic logic gates. Name them. A NOR is the combination of two other basic logic gates. Name them. Explain how you can build an XOR gate from other basic logic gates. Explain how the logic gate for a 1-bit adder can be derived. How is a multi-bit adder built from a single-bit adder? How are 1's and 0's...

  • 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]...

  • 9. (Expression Truth Table) Determine the truth table for the three-input XOR function y = 11...

    9. (Expression Truth Table) Determine the truth table for the three-input XOR function y = 11 12 13. You may first evaluate i n and then evaluate y as y=( 12) 13. In the truth table, besides the columns for 11.12.13 and y, also include a column corresponding to I 1. Also use a word statement to describe this logic function and indicate a possible application of the function 10. (Expression Circuit) Draw a circuit schematic which realizes the logic...

  • Boolean Logic A. Show the truth table for this expression: X AND (Y XOR X) B....

    Boolean Logic A. Show the truth table for this expression: X AND (Y XOR X) B. Show the truth table for this expression: Y OR (Y AND NOT X) C. Show the truth table for this expression: X NOR (Y NAND X) D. Draw a digital logic circuit for the expression used in 3A. E. Draw a digital logic circuit for the expression used in 3B. F. Draw a digital logic circuit for the expression used in 3C.

  • QB3 please, btw that's all the info. the question provided A 3-input XOR gate is equivalent...

    QB3 please, btw that's all the info. the question provided A 3-input XOR gate is equivalent to the circuit shown in Figure B3 QB3. A B -X C Figure B3 The Boolean equation can be written as: . В) С + (А-В + A:B):C X%3D (А:В +А = Or simply denote as: X%3D АФВФС Using minimum number of AND, OR and NAND gates to implement the 3-input XOR. Draw the (7 marks) logic circuit diagram A 3-input XOR gate is...

  • 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...

  • Create a truth table to implement AND logic using only NAND gates. Draw the circuit diagram...

    Create a truth table to implement AND logic using only NAND gates. Draw the circuit diagram (schematic) for the implementation. Do the same for OR logic using only NOR gates.

  • FInd: XOR Gate 1. Truth table 2. Boolean Expression 3. Write pin # of gate using...

    FInd: XOR Gate 1. Truth table 2. Boolean Expression 3. Write pin # of gate using pin configuration Findi 1. Truth Table 2. Boolean Expression 3. Write pin # of gate using pin Configuration BT QB o lo To

  • 1) Draw the diagram of XOR gate using AND, OR and NOT gates only 2) Draw...

    1) Draw the diagram of XOR gate using AND, OR and NOT gates only 2) Draw the diagram of this function (x,y) = (x’y + xy’ + x’y’) using NOT, AND gates only 3) Draw the diagram of this function (x,y,z,w) = (x’ + y’).(z + w) using 2 input NAND gates only Draw the diagram of this function (x,y,z) = xy’z using 2 input NAND gates only.

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