Why Bitwise NOT in C? - Purpose & Use Cases

The Big Idea

What if you could flip hundreds of switches instantly without touching each one?

The Scenario

Imagine you have a list of light switches represented by bits, where 1 means ON and 0 means OFF. You want to flip all the switches at once, turning every ON switch OFF and every OFF switch ON.

The Problem

Manually flipping each switch one by one is slow and tiring, especially if you have many switches. Counting and changing each bit manually can lead to mistakes and wastes time.

The Solution

The Bitwise NOT operator (~) flips all bits in one simple step. It quickly changes every 1 to 0 and every 0 to 1, saving time and avoiding errors.

Before vs After

✗ Before

for (int i = 0; i < 8; i++) { bits[i] = bits[i] == 1 ? 0 : 1; }

✓ After

flipped = ~original;

What It Enables

It lets you invert all bits instantly, enabling fast toggling of flags, masks, or binary data with a single operation.

Real Life Example

In a game, you might use Bitwise NOT to flip a player's status flags, quickly switching all active states to inactive and vice versa.

Key Takeaways

Bitwise NOT flips every bit from 0 to 1 or 1 to 0.

It replaces slow, error-prone manual bit flipping with a single operator.

Useful for toggling flags and masks efficiently.

Practice

1. What does the bitwise NOT operator ~ do to an integer in C?

easy

A. It adds 1 to the integer.

B. It shifts all bits to the left by one position.

C. It sets all bits to zero.

D. It flips every bit of the integer, changing 0s to 1s and 1s to 0s.

Solution

1. Step 1: Understand the bitwise NOT operator

   The bitwise NOT operator ~ in C flips every bit of the integer. This means all 0 bits become 1, and all 1 bits become 0.

2. Step 2: Compare with other bitwise operations

   Unlike shifting or adding, ~ only toggles bits without changing their positions or values numerically.

3. Final Answer:

   It flips every bit of the integer, changing 0s to 1s and 1s to 0s. -> Option D

4. Quick Check:

   Bitwise NOT = flip bits [OK]

Hint: Remember: ~ flips bits, not shifts or adds [OK]

Common Mistakes:

• Confusing ~ with bit shift operators << or >>
• Thinking ~ adds or subtracts from the number
• Assuming ~ sets bits to zero instead of flipping

2. Which of the following is the correct syntax to apply bitwise NOT to an integer variable x in C?

easy

A. int y = ~x;

B. int y = not x;

C. int y = !x;

D. int y = x~;

Solution

1. Step 1: Recall the bitwise NOT operator syntax

   In C, the bitwise NOT operator is the tilde symbol ~ placed before the variable.

2. Step 2: Check each option

   int y = not x; uses not which is not valid in C. int y = !x; uses logical NOT !. int y = x~; has incorrect placement of ~. Only int y = ~x; correctly uses ~x.

3. Final Answer:

   int y = ~x; -> Option A

4. Quick Check:

   Bitwise NOT syntax = ~x [OK]

Hint: Use ~ before variable for bitwise NOT [OK]

Common Mistakes:

• Using 'not' instead of ~
• Confusing logical NOT (!) with bitwise NOT (~)
• Placing ~ after the variable

3. What is the output of the following C code?

int x = 5;
int y = ~x;
printf("%d", y);

medium

A. 5

B. -6

C. -5

D. 6

Solution

1. Step 1: Convert 5 to binary and apply bitwise NOT

   5 in binary (32-bit) is 00000000 00000000 00000000 00000101. Applying ~ flips bits to 11111111 11111111 11111111 11111010.

2. Step 2: Interpret the result as a signed integer

   The result is the two's complement representation of -6.

3. Final Answer:

   -6 -> Option B

4. Quick Check:

   ~5 = -6 in two's complement [OK]

Hint: ~x equals -(x+1) for signed integers [OK]

Common Mistakes:

• Thinking ~5 equals 6 instead of -6
• Ignoring two's complement representation
• Confusing bitwise NOT with logical NOT

4. Identify the error in the following C code snippet:

int x = 10;
int y = ~ x;
printf("%d", y);

medium

A. There is a syntax error due to space between ~ and x.

B. The code will print 9 instead of expected -11.

C. No error; the code works and prints -11.

D. The printf format specifier is incorrect.

Solution

1. Step 1: Check syntax of bitwise NOT usage

   In C, spaces between operators and operands are allowed. So ~ x is valid and equivalent to ~x.

2. Step 2: Verify output and printf usage

   Applying ~10 results in -11. The printf format specifier %d is correct for int.

3. Final Answer:

   No error; the code works and prints -11. -> Option C

4. Quick Check:

   Space allowed after ~, output = -11 [OK]

Hint: Spaces don't break ~ operator usage [OK]

Common Mistakes:

• Thinking space causes syntax error
• Expecting positive output instead of negative
• Confusing format specifier for int

5. Given a signed 8-bit integer n, which expression correctly computes the bitwise NOT of n and then adds 1, effectively calculating the two's complement negation of n in C?

hard

A. ~n + 1

B. ~(n + 1)

C. -~n

D. -n + 1

Solution

1. Step 1: Understand two's complement negation

   Two's complement negation of a number n is computed as ~n + 1.

2. Step 2: Analyze each option

   ~n + 1 matches the formula. ~(n + 1) negates after adding 1, which is incorrect. -~n negates the bitwise NOT, not the number. -n + 1 is arithmetic negation plus 1, which is not two's complement negation.

3. Final Answer:

   ~n + 1 -> Option A

4. Quick Check:

   Two's complement negation = ~n + 1 [OK]

Hint: Two's complement negation = ~n + 1 [OK]

Common Mistakes:

• Using -(~n) instead of ~n + 1
• Applying ~ after adding 1
• Confusing arithmetic negation with bitwise negation