hi
int a = 3, b = 4, c, d;
a = b/a; // integerdivision -> a = 1
c = b % 3; // modulo-operator c = 1
d = 5 - --c; // prädekrement d = 5
a += 11; // a = a + 11 = 1 + 11 = 12
b = aΛ4; // bitweise exklusives oder: 1100 XOR 100 = 1000, b = 8
a = 13 | 15; // bitweise OR: 1101 OR 1111 = 1111, a = 15
c = 1 & 6; // bitweise AND: 1 & 110 = 0, c = 0.
http://ideone.com/cQz3PZ