Can you explain bitwise operations with examples?

Can you explain bitwise operations with examples?

Sure! Bitwise operations are operations that directly manipulate bits of binary numbers. For example, the AND operation compares each bit of two numbers and returns a new number where each bit is 1 only if both bits were 1.

Can you give me an example of the AND operation?

Of course! Let's take the numbers 12 (1100 in binary) and 5 (0101 in binary). The AND operation would look like this:

  1100
& 0101
------
  0100

So, 12 AND 5 equals 4.

What about the OR operation?

The OR operation works similarly but returns 1 if at least one of the bits is 1. Using the same numbers:

  1100
| 0101
------
  1101

So, 12 OR 5 equals 13.

Can you explain the XOR operation?

Certainly! The XOR (exclusive OR) operation returns 1 only if the bits are different. Using our previous example:

  1100
^ 0101
------
  1001

So, 12 XOR 5 equals 9.