JavaScript Bitwise Operators Mocktest

The bitwise left shift operator (<<) shifts the bits of the first operand to the left by the number of positions specified by the second operand. x << y results in binary 110000, which is 48 in decimal.

The bitwise right shift operator (>>) shifts the bits of the first operand to the right by the number of positions specified by the second operand. 9 >> 2

The bitwise XOR operator (^) compares each bit and returns 1 if the bits are different. 15 (binary 1111) ^ 9 (binary 1001) results in binary 0110, which is 6 in decimal.

The bitwise AND operator (&) compares each bit of the operands. 20 (binary 10100) & 14 (binary 1110) results in binary 10100, which is 12 in decimal.

The bitwise NOT operator (~) flips each bit of the operand. ~15 in binary is 1111...1110000, which is -16 in decimal due to two's complement representation.

The bitwise right shift operator (>>) shifts the bits of the first operand to the right by the number of positions specified by the second operand. 10 >> 2 results in binary 2, which is 2 in decimal.

The unsigned right shift operator (>>>) shifts the bits to the right. Unlike >>, >>> fills the vacant bits with 0. So, 7 >>> 3 results in 000, which is 0 in decimal.

The bitwise AND operator (&) compares each bit of the operands. In this case, 11 (binary 1011) & 8 (binary 1000) results in binary 1000, which is 8 in decimal.

The bitwise OR operator (

The bitwise NOT operator (~) flips each bit of the operand. ~11 in binary is 1111...1110100, which is -12 in decimal due to two's complement representation.