The XOR operator works just like the bitwise NOT operator (~) because it flips bits, but it takes two inputs. Input number 1 determines which bits will be negated in input number 2:

For example, 0000 ^ 0000 will simply leave all the bits zero.
1111 ^ 0000 will flip all the bits, so they become 1111.
1000 ^ 0000 will flip only the first bit and leave the rest unchanged. Result: 1000
1110 ^ 1101 will flip the first three bits and leave the last one unchanged. Result: 0011

The AND operator turns specific bits OFF. It takes two input numbers. The bits in input number 1 determine which bits in input number will be turned off. The ones that are zero will be turned off. Here is an example:

1001 ^ 0110 = 0000
1100 ^ 0111 = 0100
0000 ^ 1111 = 0000
1000 ^ 1111 = 1000

See, this is really simple. Here is a tiny example program:

#!/usr/bin/perl -w

use strict;
use warnings;


$a = 4;

print "\n ORIGINAL = $a";

$a &= 0xFFFB;    # 0xFFFB = 1111111111111011 binary

print "\nCLEAR BIT = $a";

$a |= 4;

print "\n  SET BIT = $a";

print("\n  XOR BIT = ", ($a ^ 0));

print("\n  XOR BIT = ", ($a ^ 0xF));

exit;
[download]