0
Add your answer:
Earn +20 pts
How From the truth table of an X-OR gate write the X-OR equivalent equation by using NOT OR and AND gate?
a XOR bis equivalent to: (a AND NOT b) OR (b AND NOT a)
Why is the and gate called the and gate?
Because if input A *and* input B is true, then the output is true! Truth table of AND gate: ┌─┬─╥───────┐ │A│B║Q (Output)│ ├─┼─╫───────┤ │0│0║0..............│ ├─┼─╫───────┤ │0│1║0............. │ ├─┼─╫───────┤ │1│0║0............. │ ├─┼─╫───────┤ │1│1║1............. │ └─┴─╨───────┘
Difference between truth table and excitation table?
truth table contains inputs and excitation table takes outputs as inputs
What is the difference between NA ND gate and NOR gate?
Truth table of 'NAND' is 0 0 - 1 0 1 - 1 1 0 - 1 1 1 - 0 NAND is just opposite of AND as the name itself suggest NAND is the not of AND Truth table of "NOR" is 0 0 - 1 0 1 - 0 1 0 - 0 1 1 - 0 NOR is just opposite of OR as the name itself suggest NOR is the not of OR.
When using a truth table 1 and 1 equal what?
As inputs to the truth table 1 and 1 signify that they are both true. The output will depend on what kind of truth table we are talking about, AND, OR, XOR, etc.
Is negative OR gate equivalent to NA ND gate?
The behavior and truth table of a Negative-ORgate is the same as for a NAND gate.
Which is not a gate?
Its truth table is: input output 0 1 1 0
How From the truth table of an X-OR gate write the X-OR equivalent equation by using NOT OR and AND gate?
a XOR bis equivalent to: (a AND NOT b) OR (b AND NOT a)
A nand gate becomes gate when used with negative logic?
negative logic means negative input values. so by checking the truth table, it becomes an OR gate
Verify truth table of NAND gate using C programming?
I don't really know what this is supposed to mean, if you want to print the truth-table of the NAND-gate that will be something like this: for (a=0; a<=1; ++a) for (b=0; b<=1; ++b) printf ("%d %d %d\n", a, b, !(a&&b))
How to convert nor GATEto not gate?
This is made by joining the inputs of a NOR gate. As a NOR gate is equivalent to an OR gate leading to NOT gate, this automatically sees to the "OR" part of the NOR gate, eliminating it from consideration and leaving only the NOT part. Truth Table Input A Output Q 0 1 1 0
Why is the and gate called the and gate?
Because if input A *and* input B is true, then the output is true! Truth table of AND gate: ┌─┬─╥───────┐ │A│B║Q (Output)│ ├─┼─╫───────┤ │0│0║0..............│ ├─┼─╫───────┤ │0│1║0............. │ ├─┼─╫───────┤ │1│0║0............. │ ├─┼─╫───────┤ │1│1║1............. │ └─┴─╨───────┘
Universal properties of NAND and NOR gate with logic diagram?
NAND gate is nothing but a AND gate with a NEGATION at its output. Its truth table is INPUT1 INPUT2 OUTPUT 0 0 1 0 1 1 1 0 1 1 1 0
Define a truth table?
A truth table is usually a table in which the truth or falsehood of two variables are taken as input and these form the edges of the table. The content of the table shows the truth value of the result of some operation on the variables.
Which logic gate have output high if and only if all inputs are low?
A nor gate provides an output of 0 when any input is 1.Nor gate provides the opposite of or gate. An or gate provides a 1 or true output when any of the inputs is 1 or true. Therefore the opposite output would be provided by a nor gate.
What is a AND gate?
Here is the truth table for a 2 input AND gate. A & B are inputs. Y is the output. A B Y 0 0 0 0 1 0 1 0 0 1 1 1 As you can see, the output of an AND gate is only 1 when all of the inputs are 1.
Difference between truth table and excitation table?
truth table contains inputs and excitation table takes outputs as inputs
