table truth table of bitwise xor bit in the second operand the truth table of bitwise xor operator is shown in table the bitwise xor operator compares each bit of its first operand with the corresponding bit of its second operand if one of the bits is the corresponding bit in the result is and otherwise for example bitwise not (~the bitwise not or complement is unary operator that performs logical negation on each bit of the operand by performing negation of each bitit actually produces the one' complement of the given binary value bitwise not operator sets the bit to if it was initially and sets it to if it was initially for example ~ shift operators supports two bitwise shift operators they are shift left (>the syntax for shift operation can be given as operand op num where the bits in the operand are shifted left or right depending on the operator (leftif the operator is >by number of places denoted by num for exampleif we have then < produces when we apply left shiftevery bit in is shifted to the left by one place sothe msb (most significant bitof is lostthe lsb (least significant bitof is set to thereforeif we have then < gives result on the contrarywhen we apply right shiftevery bit in is shifted to the right by one place sothe lsb of is lostthe msb of is set to for exampleif we have then > gives result similarlyif we have then > gives result note the expression is equivalent to division of by if is unsigned or has non-negative value assignment operators in languagethe assignment operator is responsible for assigning values to the variables while the equal sign (=is the fundamental assignment operatorc also supports other assignment operators that provide shorthand ways to represent common variable assignments when an equal sign is encountered in an expressionthe compiler processes the statement on the right side of the sign and assigns the result to the variable on the left side for exampleint xx assigns the value to variable the assignment operator has right-to-left associativityso the expression