Bitwise NOT

Bitwise NOT: how to work it out

The bitwise NOT operation flips each bit in a binary number: every 0 becomes 1, and every 1 becomes 0. Your goal is to apply that flip to the entire given bit pattern, then write the result in its simplest final form.

Method

1. Read the bits carefully from left to right.
2. Replace each bit:
   • 0 → 1
   • 1 → 0
3. Keep the same bit positions while changing only the values.
4. Write the final simplified answer exactly as the flipped bit pattern.

Example of the process

If a bit pattern is 1010, then bitwise NOT changes it to 0101.

Check your work

• Make sure every bit was changed.
• Confirm no extra bits were added or removed.
• If the problem expects a simplified final answer, give only the resulting flipped pattern.

A good final check is to compare the original and your answer bit by bit: each position should be the opposite of the original.