0
There is a circuit using there nand gates with two inputs and one output find the output?
Wiki User
∙ 15y ago
A "Nand" gate is an "And" gate with an "Inverter" added to its output. To get a logic 1 output from a "Nand" gate, you need a logic 0 on both of its inputs. If I understand your question correctly, you have three "Nand" gates. Presumably the outputs of two of them are connected to the inputs of the third. Logic 1 at both inputs of the first two "Nand" gates will produce a logic 0 output from both of them. The two logic 0's are fed to the inputs of the third "Nand" gate producing a logic 0 output from the third "Nand" gate.
Wiki User
∙ 15y ago
Add your answer:
Earn +20 pts
Half-Subtractor circuit using NOR gates?
By using 5 NOR gates, we can implements half-subtractor. The inputs for 1st NOR gate are A and B, for 2nd NOR gate inputs are the output of 1st NOR gate and A input, for 3rd NOR gate inputs are the output of 1st NOR gate and B input, for 4th NOR gate the inputs are gates 2 and 3, and for last gate input is the output of the 4th gate.
There is a circuit using 3 nand gates with 2 inputs and 1 output.f ind the output?
Final answer will be NAND bz from first NAND ans NOT AND then Again NOT ( NOT AND) ans AND then Again NOT ( AND) so final ans will be NAND.
Device a circuit to perform OR logic using only NOR gate?
Use two NOR gates. Tie the output of the first to both (or all) inputs of the second. A logic one at any input of the first produces a logic one at the output of the second which is a standard OR.
Why in computer or in any other digital circuit design the help of boolean algebra is used?
Boolean algebra is used in logic circuits. Using And, Nor, Xor and Nand gates to determine the state of an output, dependant on the condition of various inputs. Or, if you like, to make a fixed decision based on the inputs. When designing a logic circuit, it is easy to get confused by too many steps in the process to get the answer that you want. By using Boolean algebra, the steps can be rationalised and reduce to the minimum number of steps, before committing to a finished physical circuit.
How to Design and draw a combinational circuit using AND-OR-NOT gates that accepts an input number of three bits. The output of the circuit is a 6 bit number that is the square of the input number?
first create truth table, inputs should be combination of 3 bits i.e 8 possible combination. the outputs are the square of each input. you need 6 bits for the outputs since the square of 7 is 49 which is binary notation 49 is (110001) hence 6 bits. same goes for the other inputs. when the table is complete. find the Boolean function that drives each bit, preferably by K-maps to minimize the logic. Then from the equations, simply draw the circuit by using the necessary logic gates. There will be 3 inputs and 6 outputs for the overall circuit. Very easy but tedious. have fun
Circuit diagram of xor gate using minimum number of nand gates?
The XOR gate (sometimes EOR gate, or EXOR gate) is a digital logic gate that implements an exclusive or; that is, a true output (1) results if one, and only one, of the inputs to the gate is true (1). If both inputs are false (0) or both are true (1), a false output (0) results. Its behavior is summarized in the truth table shown on the right. A way to remember XOR is "one or the other but not both". It represents the inequality function, i.e., the output is HIGH (1) if the inputs are not alike otherwise the output is LOW (0).
Can an AND gate be formed by using two OR gates?
AND gate is A.B If two not gates are added at both inputs of and gate then output becomes A'.B' which is equal to (A+B)' by DeMorgan's law. hence the nor gate is formed Update: Put more simply, invert A and B by attaching A to both inputs of one NOR and attaching B to both inputs of another NOR, then NOR the results of the previous two NOR gates. Total of three NOR gates in a two-level implementation. NAND can obviously be created by inverting the result.
How logic gates are made?
Logic gates are simply performing some logic operation like ANDing, ORing and so on. these logical operation can be implemented using switching device for example diode, BJT's or MOSFET's. take 2 input NAND gate for example. the truth table for 2 inputs A, B the number of input combination is 4 and for each set of input value the output value of this gate can be represented as : A B NAND 0 0 1 0 1 1 1 0 1 1 1 0 from the truth table we can see that we need a circuit which gave a zero output when both the inputs are high so if we have switch/s connected between output and ground then this switch should work when both the inputs are high and this will pull the output node voltage to zero.
What is gating computer?
Logic gates are transistor circuits, normally arranged on a silicon base and encapsulated inside an integrated circuit. (chip). Using several transistors wired together, their inputs can be arranged such that, for given inputs, the output will only change state for certain conditions. The transistor switches are in either of two states, 'on' and 'off'. These are logic states 1 & 0 (one or zero), hence binary. The logic uses Boolean algebra. NOT, means it is 'not on', = OFF. This is abbreviated in the descriptions as the letter 'N' A simple AND gate, means that the output is at level zero until both inputs have a level 1 voltage on them. A NAND gate is a 'Not And' gate. The result is reversed. The output is always at logic level 1 until both inputs also have a level 1 also.
What is computer logic gates?
Logic gates are transistor circuits, normally arranged on a silicon base and encapsulated inside an integrated circuit. (chip). Using several transistors wired together, their inputs can be arranged such that, for given inputs, the output will only change state for certain conditions. The transistor switches are in either of two states, 'on' and 'off'. These are logic states 1 & 0 (one or zero), hence binary. The logic uses Boolean algebra. NOT, means it is 'not on', = OFF. This is abbreviated in the descriptions as the letter 'N' A simple AND gate, means that the output is at level zero until both inputs have a level 1 voltage on them. A NAND gate is a 'Not And' gate. The result is reversed. The output is always at logic level 1 until both inputs also have a level 1 also.
Design and draw a combinational circuit using AND-OR-NOT gates that accepts 4 input bits and produces two bit output the first of the two bits is set to 1 if the number of 1s in the input is even?
Design and draw a combinational circuit using AND-OR-NOT gates that accepts 4 input bits, and produces two bit output; the first of the two bits is set to 1 if the number of 1's in the input is even; and the second of the output bit is set to 1 if the input have 3 or more (all four) 1 bits.
How can you make boolean circuit?
Boolean circuits are logic circuits consisting of various "gates" that are arranged to combine two or more bits into a single-bit output. Using the term "false" to represent an input/output that is "off" or a "0"; "true" to represent an input/output that is "on" or a "1"; and A, B, C, etc. as inputs and X as the ouput... AND gate: has two or more inputs that will result in a true output only if all of the inputs are true. If A AND B AND C are true, then X is true. OR gate: has two or more inputs that will result in a true output if any one of the inputs is true. If A OR B OR C is true, then X is true. XOR (eXclusive OR) gate: has two inputs that will result in a true output if and only if one of the two inputs is true. If A AND B are both true or both false, then X is false.If A is true OR B is true, then X is true. NOT gate: inverts the value of a single input. If A is true, then X is false. If A is false, then X is true. Gates called NAND (NOT-AND) and NOR (NOT-OR) have a built-in NOT function for the output. You can build a very simple AND or OR gate using two switches and a bulb. If the switches are wired in series so that both must be on for the bulb to light, that is an AND gate. If the switches are wired in parallel so that either one will light the bulb, that is an OR gate. XOR is somewhat more complex, but can be simulated with two-position switches. NOT would require a relay that lights the bulb when there is no power to its coil. Some info on Boolean logic and circuits: http://en.wikipedia.org/wiki/Boolean_circuits
