Bitwise XOR operations (exclusive OR) take two binary numbers and compare each digit individually, following specific logical rules. For example:

b00110011 XOR b00001111 is b00111100.


Here is a truth table of the XOR function:

A	B	AND
0	0	0
0	1	1
1	0	1
1	1	0

XOR is almost identical to the OR function because they both require that at least one bit must be 1 to trigger XOR's function to be true, however, if all bits measured are 1 in XOR, the result will be 0.

LC-3 does not natively support the XOR function.


Find more about bitwise XOR operation in these tutorials: