Why Set Clear Toggle a Specific Bit in DSA C++?

The Big Idea

What if you could flip just one switch in a sea of hundreds instantly and perfectly every time?

The Scenario

Imagine you have a huge control panel with hundreds of switches, each representing a feature turned on or off. You want to change just one switch without touching the others. Doing this by flipping each switch manually is slow and confusing.

The Problem

Manually checking and changing each switch one by one takes a lot of time and is easy to make mistakes. You might accidentally flip the wrong switch or forget to turn one off. This makes managing many switches very error-prone and frustrating.

The Solution

Using bit operations lets you directly change just one switch (bit) in a number without affecting the others. You can set, clear, or toggle a specific bit quickly and safely with simple commands, making your control panel easy to manage.

Before vs After

✗ Before

int switches = 0b1010;
// To set bit 1 manually
if ((switches & (1 << 1)) == 0) {
  switches += (1 << 1);
}

✓ After

int switches = 0b1010;
// Set bit 1
switches |= (1 << 1);

What It Enables

This lets you control individual features or flags efficiently, enabling fast and precise updates in programs and systems.

Real Life Example

In video games, bit operations control player abilities or game settings stored as bits. Quickly turning a feature on or off without affecting others keeps the game running smoothly.

Key Takeaways

Manual bit changes are slow and error-prone.

Bit operations let you change one bit without touching others.

Set, clear, and toggle bits efficiently for precise control.

Practice

1. What does the operation num |= (1 << k) do to the integer num in C++?

easy

A. Toggles the k-th bit of num

B. Sets the k-th bit of num to 1

C. Clears the k-th bit of num to 0

D. Checks if the k-th bit of num is set

Solution

1. Step 1: Understand the bit shift operation

   The expression 1 << k creates a number with only the k-th bit set to 1 and all others 0.

2. Step 2: Apply bitwise OR to set the bit

   Using |= with this mask sets the k-th bit of num to 1 without changing other bits.

3. Final Answer:

   Sets the k-th bit of num to 1 -> Option B

4. Quick Check:

   num |= (1 << k) sets bit k [OK]

Hint: Use OR with shifted 1 to set a bit [OK]

Common Mistakes:

• Confusing set with clear operation
• Using AND instead of OR to set bits
• Misunderstanding bit positions starting from 0

2. Which of the following is the correct syntax to clear the 3rd bit (0-indexed) of an integer variable num in C++?

easy

A. num &= ~(1 << 3);

B. num |= (1 << 3);

C. num ^= (1 << 3);

D. num = (num & (1 << 3));

Solution

1. Step 1: Create mask to clear bit

   1 << 3 sets only the 3rd bit. Negating it with ~ creates a mask with all bits 1 except the 3rd bit 0.

2. Step 2: Use AND assignment to clear bit

   Applying &= with this mask clears the 3rd bit of num while keeping others unchanged.

3. Final Answer:

   num &= ~(1 << 3); -> Option A

4. Quick Check:

   AND with negated mask clears bit [OK]

Hint: Use AND with negated shifted 1 to clear bit [OK]

Common Mistakes:

• Using OR instead of AND to clear bits
• Forgetting to negate the mask
• Using XOR which toggles instead of clears

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

int num = 10; // binary 1010
num ^= (1 << 1);
std::cout << num << std::endl;

medium

A. 8

B. 10

C. 12

D. 14

Solution

1. Step 1: Understand initial value and bit positions

   num = 10 in binary is 1010. Bits are indexed from 0 (rightmost). Bit 1 is currently 1.

2. Step 2: Toggle the 1st bit using XOR

   num ^= (1 << 1) toggles bit 1. Since bit 1 is 1, toggling it changes it to 0. New binary: 1000 (decimal 8).

3. Final Answer:

   8 -> Option A

4. Quick Check:

   Toggle bit 1 of 1010 = 1000 = 8 [OK]

Hint: XOR toggles bits; 1 flips, 0 stays same [OK]

Common Mistakes:

• Confusing toggle with set or clear
• Miscounting bit positions starting at 1 instead of 0
• Assuming XOR always sets bit

4. Identify the error in the following code snippet that attempts to clear the 2nd bit of num:

int num = 15;
num = num & (1 << 2);
std::cout << num << std::endl;

medium

A. It sets only the 2nd bit instead of clearing it

B. It toggles the 2nd bit instead of clearing it

C. It clears all bits except the 2nd bit

D. It causes a syntax error due to missing parentheses

Solution

1. Step 1: Analyze the mask used

   The mask (1 << 2) has only the 2nd bit set to 1, all others 0.

2. Step 2: Understand the effect of AND with mask

   ANDing num with this mask keeps only the 2nd bit of num and clears all others. This is opposite of clearing the 2nd bit.

3. Final Answer:

   It clears all bits except the 2nd bit -> Option C

4. Quick Check:

   AND with mask keeps bit, does not clear it [OK]

Hint: Use AND with negated mask to clear bits, not plain mask [OK]

Common Mistakes:

• Using mask directly instead of negated mask
• Confusing AND with OR for clearing bits
• Assuming AND with mask clears bit

5. Given an integer num, which expression correctly toggles the 0th bit only if it is currently set (1), otherwise leaves num unchanged?

hard

A. num ^= 1;

B. num &= ~1;

C. num |= 1;

D. if ((num & 1) == 1) num ^= 1;

Solution

1. Step 1: Check if 0th bit is set

   The condition (num & 1) == 1 checks if the least significant bit is 1.

2. Step 2: Toggle 0th bit only if set

   If the bit is set, num ^= 1 toggles it to 0. Otherwise, no change is made.

3. Final Answer:

   if ((num & 1) == 1) num ^= 1; -> Option D

4. Quick Check:

   Toggle only if bit set using condition [OK]

Hint: Check bit before toggling to avoid unwanted changes [OK]

Common Mistakes:

• Toggling bit unconditionally
• Using OR or AND which always set or clear bit
• Not checking bit state before toggle