0
It is mainly implemented in error detection and correction.
It is used for performing modulo arithmetic.
Wiki User
∙ 11y ago
Add your answer:
Earn +20 pts
Any possible binary logic function can be implemented using only?
AND and NOT; OR and NOT; EQU and NOT; XOR
How do you represent assignment by bitwise XOR operator?
The bitwise XOR operator is ^, or shift 6. The bitwise XOR assignment operator is ^=.
What is XOR in a c program?
a XOR b is a^b in C language
Prove that XOR and AND gates form universal set?
If you're allowed to prove this the easy way (by showing you can use XOR and AND to create the set of AND, OR, and NOT), this is pretty straightforward. x AND y = x AND y (of course) x OR y = (x XOR y) XOR (x AND y) NOT x = x XOR 1 Also, (x AND y) XOR 1 is equivalent to x NAND y, which is a universal gate.
How xor gate is linear?
its not
Any possible binary logic function can be implemented using only?
AND and NOT; OR and NOT; EQU and NOT; XOR
How can you write a program to convert binary code to gray code using 8085 microprocessor?
It can be implemented very easily .... Suppose the Binary word is X7X6X5.... X0 then the corresponding Gray code is G7G6G5....G0 where G7=X7 G6=X7 XOR X6 G5=X6 XOR X5 ..... G0=X1 XOR X0 Now implement the above algorithm
How can you represent XOR function symbol in word?
xor
How do you represent assignment by bitwise XOR operator?
The bitwise XOR operator is ^, or shift 6. The bitwise XOR assignment operator is ^=.
What is XOR in a c program?
a XOR b is a^b in C language
Is xor gate is derived gate?
yes... xor is derived gate from primary gates
Prove that XOR and AND gates form universal set?
If you're allowed to prove this the easy way (by showing you can use XOR and AND to create the set of AND, OR, and NOT), this is pretty straightforward. x AND y = x AND y (of course) x OR y = (x XOR y) XOR (x AND y) NOT x = x XOR 1 Also, (x AND y) XOR 1 is equivalent to x NAND y, which is a universal gate.
Why XOR gate and XNOR gate are not universial gate?
xor and xnor gates are derived from not gate
What circuit produces a high output when two inputs are unequal?
Not sure about the comparator. XOR is what I came up with, so we have two XORs. This is the "exclusive OR" logic function. Build one out of standard resistors and transistors, or buy an IC with the XOR function already implemented, or use four two-input NAND gates. At least that's the way we did it in the 1960s. In analog circuits, a comparator.
How many xor gates required for 4 bit parity checker?
3*xor- two input
How do you convert binary to gray code using labview?
We know the formula G3=B3 G2=B2 XOR B3 G1=B1 XOR B2 G0=B0 XOR B1
How do you swap two variables using bitwise operators?
a := a XOR b b := a XOR b a := a XOR b it works, but never use it in real programs do you know why its not used in real program??
