#javascript Bitwise Operators Part-2 ??| Let's start with JavaScript | By CarryCoder | Hindi |

Bitwise operators are tools in computer programming that allow us to manipulate individual bits of binary numbers. They work at the level of 0s and 1s, enabling us to perform operations like comparing, combining, and modifying binary digits. These operators help us work with binary data in a more precise and efficient manner, providing essential building blocks for tasks such as encryption, data compression, and low-level optimizations.

Bitwise AND (&): Compares the corresponding bits of two numbers and returns a new number where the resulting bits are set to 1 only if both input bits are 1.

Bitwise OR (|): Compares the corresponding bits of two numbers and returns a new number where the resulting bits are set to 1 if either of the input bits is 1.

Bitwise XOR (^): Compares the corresponding bits of two numbers and returns a new number where the resulting bits are set to 1 if the input bits are different (one bit is 1 and the other is 0).

Bitwise NOT (~): Flips the bits of a number, changing 1s to 0s and 0s to 1s.

Left Shift : Shifts the bits of a number to the left by a specified number of positions. This is equivalent to multiplying the number by 2 raised to the power of the shift amount.

Right Shift : Shifts the bits of a number to the right by a specified number of positions. This is equivalent to dividing the number by 2 raised to the power of the shift amount.

Zero-filled right shift : is a bitwise operator available in some programming languages, such as JavaScript. It performs a right shift operation on the binary representation of a number, shifting the bits to the right by a specified number of positions. Unlike the regular right shift , the zero-filled right shift fills the vacant leftmost positions with zeros.