Why Bit Manipulation and When It Beats Arithmetic in DSA C# - Test Your Knowledge

Practice - 5 Tasks

1fill in blank

easy

Complete the code to double the value using bit manipulation.

DSA C#

int result = number [1] 1;

Drag options to blanks, or click blank then click option'

A>>

B-

C+

D<<

Attempts:

3 left

💡 Hint

Common Mistakes

Using right shift >> which halves the number.

Using addition + which works but is not bit manipulation.

Left shifting by 1 bit multiplies the number by 2.

2fill in blank

medium

Complete the code to check if a number is even using bit manipulation.

DSA C#

bool isEven = (number [1] 1) == 0;

Drag options to blanks, or click blank then click option'

A|

B&

C^

D<<

Attempts:

3 left

💡 Hint

Common Mistakes

Using bitwise OR | which does not check the last bit.

Using XOR ^ which toggles bits.

Using bitwise AND with 1 checks the least significant bit; if 0, number is even.

3fill in blank

hard

Fix the error in the code to toggle the 3rd bit of a number.

DSA C#

int toggled = number [1] (1 << 2);

Drag options to blanks, or click blank then click option'

A^

B|

C&

D>>

Attempts:

3 left

💡 Hint

Common Mistakes

Using AND & which clears bits.

Using OR | which sets bits but does not toggle.

XOR ^ toggles the bit at the specified position.

4fill in blank

hard

Fill both blanks to create a mask that extracts the last 4 bits of a number.

DSA C#

int mask = (1 [1] 4) [2] 1;

Drag options to blanks, or click blank then click option'

A<<

B+

C-

D|

Attempts:

3 left

💡 Hint

Common Mistakes

Using addition instead of subtraction changes mask value.

Using OR | instead of subtraction results in wrong mask.

Shift 1 left by 4 bits then subtract 1 to get mask 0b1111 (last 4 bits).

5fill in blank

hard

Fill all three blanks to set the 5th bit of a number and clear the 2nd bit.

DSA C#

number = (number [1] (1 << 4)) [2] ([3] (1 << 1));

Drag options to blanks, or click blank then click option'

A|

B&

C~

D^

Attempts:

3 left

💡 Hint

Common Mistakes

Using XOR ^ instead of OR | to set bits.

Not negating the mask when clearing bits.

Use OR | to set 5th bit, AND & with NOT ~ mask to clear 2nd bit.

Practice

1. Why is bit manipulation often faster than arithmetic operations like multiplication or division?

easy

A. Because bit manipulation uses simple CPU instructions that run in constant time

B. Because arithmetic operations require more memory allocation

C. Because bit manipulation uses floating-point calculations

D. Because arithmetic operations are not supported by modern CPUs

Solution

1. Step 1: Understand CPU instruction speed

   Bit manipulation uses basic CPU instructions like AND, OR, XOR, and shifts which are very fast and usually take one CPU cycle.

2. Step 2: Compare with arithmetic operations

   Multiplication and division are more complex and take multiple CPU cycles, making them slower than bit operations.

3. Final Answer:

   Because bit manipulation uses simple CPU instructions that run in constant time -> Option A

4. Quick Check:

   Bit manipulation = faster CPU instructions [OK]

Hint: Bit ops use simple CPU steps, arithmetic takes longer [OK]

Common Mistakes:

• Thinking bit manipulation uses more memory
• Confusing bit manipulation with floating-point math
• Believing arithmetic is unsupported on CPUs

2. Which of the following C# expressions correctly uses bit manipulation to multiply an integer x by 8?

easy

A. x | 8

B. x >> 3

C. x & 8

D. x << 3

Solution

1. Step 1: Understand left shift operation

   Left shifting a number by 3 bits (x << 3) multiplies it by 2^3 = 8.

2. Step 2: Check other options

   x >> 3 divides by 8, x & 8 does bitwise AND, x | 8 does bitwise OR, none multiply by 8.

3. Final Answer:

   x << 3 -> Option D

4. Quick Check:

   Left shift by 3 = multiply by 8 [OK]

Hint: Left shift by n bits multiplies by 2^n [OK]

Common Mistakes:

• Using right shift instead of left shift
• Confusing AND/OR with multiplication
• Forgetting shift counts start at zero

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

int x = 12;  // binary 1100
int y = x & 5; // binary 0101
Console.WriteLine(y);

medium

A. 4

B. 5

C. 12

D. 1

Solution

1. Step 1: Convert numbers to binary

   x = 12 is 1100 in binary, 5 is 0101 in binary.

2. Step 2: Perform bitwise AND

   1100 & 0101 = 0100 (only bits set in both), which is 4 in decimal.

3. Final Answer:

   4 -> Option A

4. Quick Check:

   12 & 5 = 4 [OK]

Hint: AND keeps bits set in both numbers only [OK]

Common Mistakes:

• Confusing AND with OR operation
• Reading binary digits incorrectly
• Assuming output is decimal 5 or 12

4. Identify the error in this C# code snippet that tries to check if a number is even using bit manipulation:

int num = 10;
if (num & 1 == 0)
    Console.WriteLine("Even");
else
    Console.WriteLine("Odd");

medium

A. Incorrect variable type for bitwise operation

B. Missing parentheses around bitwise operation: should be (num & 1) == 0

C. Using bitwise AND instead of logical AND

D. Should use num % 2 == 0 instead of bitwise operation

Solution

1. Step 1: Understand operator precedence

   In C#, == has higher precedence than &, so num & 1 == 0 is evaluated as num & (1 == 0).

2. Step 2: Fix expression with parentheses

   We must write (num & 1) == 0 to correctly check if the least significant bit is zero (even number).

3. Final Answer:

   Missing parentheses around bitwise operation: should be (num & 1) == 0 -> Option B

4. Quick Check:

   Use parentheses to group bitwise ops [OK]

Hint: Add parentheses around bitwise ops before comparisons [OK]

Common Mistakes:

• Ignoring operator precedence rules
• Using logical AND instead of bitwise AND
• Thinking bitwise ops need special variable types

5. You want to quickly check if an integer n is a power of two using bit manipulation in C#. Which expression correctly does this and why does it beat using division or loops?

bool isPowerOfTwo = (n & (n - 1)) == 0 && n != 0;

hard

A. It counts bits in n; slower but more accurate than division

B. It divides n by 2 repeatedly; equivalent speed to loops

C. It checks if only one bit is set in n; faster than loops or division

D. It uses modulo operation internally; slower than bit shifts

Solution

1. Step 1: Understand the bit trick

   The expression n & (n - 1) clears the lowest set bit. If the result is zero, n had only one bit set, meaning it is a power of two.

2. Step 2: Compare with other methods

   This bit trick runs in constant time, faster than loops or division which take multiple steps.

3. Final Answer:

   It checks if only one bit is set in n; faster than loops or division -> Option C

4. Quick Check:

   n & (n-1) == 0 means power of two [OK]

Hint: Check n & (n-1) == 0 for power of two fast [OK]

Common Mistakes:

• Not checking n != 0 to exclude zero
• Using loops or division instead of bit trick
• Misunderstanding what the bitwise AND does