any gate i can substitute to xor gate?
if i dont have xor gate what gate i can use to substitute it?
If this is homework - what is XOR in boolean algebra ?
In practical terms you can build any logic out of either NAND or NOR, most chips only implement one of these.
define xor with a truth table.
nope not a homework
i want to make a binary adder cuircuit i dont have an xor gate only and, or & not.
0 0 -0
xor = not(a).b + a.not(b)
I also thought this is a homework problem. You can easily get this into and/or gates. If there are more than 2 inputs, you should be using k-maps. Once, you have in and/or gates, it is simple to convert it into nand (using Sum of products form) or nors (using products of sums or simply messing with bool algebra...)
Isn't it, A or B and not( A and B)
Separate names with a comma.