Why Bit Manipulation and When It Beats Arithmetic in DSA Go - Challenge Your Understanding

Challenge - 5 Problems

❓ Predict Output

intermediate

Output of Bitwise AND vs Arithmetic AND

What is the output of the following Go code snippet?

DSA Go

package main
import "fmt"
func main() {
    a := 12  // binary: 1100
    b := 10  // binary: 1010
    fmt.Println(a & b)
}

A 8

B 2

C 4

D 10

💡 Hint

Bitwise AND compares bits of two numbers and returns 1 only if both bits are 1.

The bitwise AND of 12 (1100) and 10 (1010) is 8 (1000 in binary).

❓ Predict Output

intermediate

Output of Left Shift vs Multiplication

What is the output of this Go code snippet?

DSA Go

package main
import "fmt"
func main() {
    x := 7
    y := x << 2
    fmt.Println(y)
}

A 21

B 14

C 28

D 56

💡 Hint

Left shift by 2 bits multiplies the number by 4.

Shifting 7 left by 2 bits equals 7 * 4 = 28.

🔧 Debug

advanced

Why Does This Bitwise XOR Code Fail?

What error or output does this Go code produce?

DSA Go

package main
import "fmt"
func main() {
    var a int = 15
    var b int = 7
    fmt.Println(a ^ b)
    fmt.Println(a ^^ b)
}

A 8 and 6

B 8 and SyntaxError

C 8 and 0

D SyntaxError and 6

💡 Hint

Check the operator symbols carefully.

The first print outputs 8 (bitwise XOR of 15 and 7). The second print uses ^^ which is invalid syntax in Go, causing a compile error.

🧠 Conceptual

advanced

When Does Bit Manipulation Beat Arithmetic?

Which scenario best explains when bit manipulation is faster than arithmetic operations?

A When concatenating strings

B When adding two large numbers

C When calculating square roots

D When multiplying or dividing by powers of two

💡 Hint

Bit shifts can replace multiplication or division by 2, 4, 8, etc.

Bit manipulation is faster for multiplying or dividing by powers of two because shifting bits is simpler than arithmetic operations.

🚀 Application

expert

Find the Single Number Using Bit Manipulation

Given an array where every element appears twice except one, which bit manipulation operation helps find the single element efficiently?

A Using XOR to cancel out duplicates

B Using AND to find common bits

C Using OR to combine all bits

D Using NOT to invert bits

💡 Hint

XOR of a number with itself is zero.

XORing all elements cancels out duplicates because x ^ x = 0, leaving the unique element.

Practice

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

easy

A. Because bit manipulation uses more memory which speeds up processing

B. Because arithmetic operations are not supported by modern CPUs

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

D. Because arithmetic operations always cause errors in calculations

Solution

1. Step 1: Understand CPU instruction speed

   Bit manipulation uses basic CPU instructions like AND, OR, XOR, 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 C

4. Quick Check:

   Bit ops faster than arithmetic [OK]

Hint: Bit ops use simple CPU steps, so they run faster [OK]

Common Mistakes:

• Thinking arithmetic is always faster
• Confusing memory use with speed
• Believing CPUs don't support arithmetic

2. Which of the following Go code snippets correctly uses bit manipulation to multiply an integer by 8?

easy

A. result := num >> 3

B. result := num << 3

C. result := num & 8

D. result := num ^ 8

Solution

1. Step 1: Understand bit shift left operation

   Shifting bits left by 3 positions multiplies the number by 2^3 = 8.

2. Step 2: Check other operations

   Right shift divides, AND masks bits, XOR toggles bits, so they don't multiply by 8.

3. Final Answer:

   result := num << 3 -> Option B

4. Quick Check:

   Left shift by 3 multiplies by 8 [OK]

Hint: Use << 3 to multiply by 8 quickly [OK]

Common Mistakes:

• Using >> instead of << for multiplication
• Using & or ^ which do not multiply
• Confusing shift count with multiplication factor

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

num := 12
result := (num & 7) << 1
fmt.Println(result)

medium

A. 8

B. 10

C. 14

D. 24

Solution

1. Step 1: Calculate num & 7

   12 in binary is 1100, 7 is 0111. Bitwise AND: 1100 & 0111 = 0100 (decimal 4).

2. Step 2: Shift left by 1

   4 << 1 means 4 * 2 = 8.

3. Final Answer:

   8 -> Option A

4. Quick Check:

   (12 & 7) << 1 = 8 [OK]

Hint: AND then shift left doubles the masked value [OK]

Common Mistakes:

• Misreading binary AND result
• Confusing left shift with right shift
• Calculating decimal incorrectly

4. Find the error in this Go code that tries to check if a number is even using bit manipulation:

func isEven(num int) bool {
    return num & 1 == 0
}

medium

A. Missing parentheses around bitwise operation

B. Incorrect operator precedence causes wrong result

C. Bitwise AND cannot be used with integers

D. No error, code works correctly

Solution

1. Step 1: Understand operator precedence in Go

   Bitwise AND (&) has higher precedence than ==, so expression evaluates as (num & 1) == 0 correctly.

2. Step 2: Check if code logic is correct

   Checking if last bit is 0 means number is even, so function returns true for even numbers.

3. Final Answer:

   No error, code works correctly -> Option D

4. Quick Check:

   Bitwise AND with 1 checks evenness correctly [OK]

Hint: Bitwise AND with 1 checks last bit correctly [OK]

Common Mistakes:

• Assuming operator precedence error
• Thinking bitwise AND can't be used with ints
• Adding unnecessary parentheses

5. You want to quickly check if a number is a power of two using bit manipulation in Go. Which expression correctly does this?

func isPowerOfTwo(num int) bool {
    return ???
}

hard

A. num & (num - 1) == 0 && num != 0

B. num | (num - 1) == 0

C. num ^ (num - 1) == 0

D. num & (num + 1) == 0

Solution

1. Step 1: Recall power of two property

   A power of two has exactly one bit set. num & (num - 1) clears the lowest set bit.

2. Step 2: Check expression meaning

   If num is power of two, num & (num - 1) == 0. Also check num != 0 to exclude zero.

3. Step 3: Verify other options

   OR, XOR, and & with (num + 1) do not correctly test power of two.

4. Final Answer:

   num & (num - 1) == 0 && num != 0 -> Option A

5. Quick Check:

   Power of two test uses num & (num-1) = 0 [OK]

Hint: Use num & (num-1) == 0 to test power of two [OK]

Common Mistakes:

• Using OR or XOR instead of AND
• Not checking num != 0
• Using num + 1 instead of num - 1