Show how 2-var multiplexers could be used to build basic gates (NAND, NOR, NOT)
2-input NAND gate using 2:1 mux
the truth table of a 2-input NAND gate. If we observe carefully, OUT equals '1' when A is '0'. Similarly, when A is '1', OUT is B'. So, if we connect SEL pin of mux to A, S0 pin of mux to '1' and S1 to B', then it will act as a NAND gate.

2-input NOR gate 2:1 MUX: If we observe carefully, OUT equal B' when A is '0'. Similarly, OUT equals '0' when A is '1'. So, we can make a 2-input mux act like a 2-input NOR gate, if we connect SEL of mux to A, S0 to B' and S1 to '0'.

NOT gate using 2:1 mux: The only inverting path in a multiplexer is from select to output. To implement NOT gate with the help of a mux, we just need to enable this inverting path. This will happen if we connect S0 to '1' and S1 to '0'.

Show how 2-var multiplexers could be used to build basic gates (NAND, NOR, NOT)
2. NAND and NOR gates are the universal logic gates. To prove this property of universal gates, show how the basic/ standard logic gates (AND, OR, NOT) can be implemented using only NAND and NOR gates. (Hint: Show six circuits in total: three with only NAND gates and three with only NOR gates)
Show how you can use a 1-var Multiplexer (and NOT gates) to build basic gates such as AND, OR, NOT, XOR, etc. For the NOT gate, try to not use any NOT gates in the schematic
If only NOR gates can be used to build a circuit for the following expression (i.e.. no INVERTERS are allowed... inverters must be built with NOR gates), how many NOR gates would be required? Note Do not try to simplify or change the expression... implement it as is. B+C+A
Draw the logic diagram of a 2-to-4-line decoder using (a) NOR gates only and (b) NAND gates only. please show the steps
Q2. [60 marks] A logical function is realized by the combination of NAND and NOR gates with the ircuit connections shown in Figure1. a. [20 points] Find the Boolean expression of the function F b. [20 points] Simplify the Boolean expression using Boolean Algebra; c. [20 points] Re-design the circuit using the least NAND-only gates (each NAND has 2 inputs). F(A,B,C) Figure 2: Logical circuit with NAND and NOR.
A. Convert to NAND gates only. F(A,B,C,D) = ∑(0,2,5,6,8,10,13,14) answer is B'D'+CD'+BC'D can you show how to convert to NAND gates only B. Convert to NOR gates only and show how to compliment it. F(A,B,C,D) = ∏(0,2,5,6,8,10,13,14)
Show that the NOR gate is universal by showing how to build AND,OR, and NOT functions using two-input NOR gates.
1. What logic gates are known as universal gates? (1 point) a) nand, nor b) and, or, not c) nand, nor, xor, xnor d) None of the above 2. Write the half adder truth table. (4 points) 3. Fill in the blank. (1 point) A2 to 1 mux has input lines. 4. True or False? (1 point) A Boolean algebraic sum of products expression is the complement of the product of sums expression. 5. What is the minimum POS expression...
First you must create a logic circuit using only basic gates such as AND, OR, NOR, NAND, NOT, etc. to implement an ADDER capable of adding two 4 bit binary numbers. Second you must create a logic circuit using only basic gates such as AND, OR, NOR, NAND, NOT, etc. to implement a Subtractor that is capable of subtracting the second number from the first, by converting the second number into its 2's complement form and then adding the resulting...
For each of the following show the logic circuit with only NAND gates and also show the truth table. Create a NOT gate. Create an AND gate. Create an OR gate. Create a NOR gate. Create an XOR gate. Create a Half Adder