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

Practice - 5 Tasks

1fill in blank

easy

Complete the code to double the value using bit manipulation.

DSA Java

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 instead of left shift.

Using bitwise AND or OR instead of shift.

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 Java

boolean 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 OR or XOR instead of AND.

Using shift operators incorrectly.

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 divide a number by 4 using bit manipulation.

DSA Java

int result = number [1] 2;

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

A<<

B&

C|

D>>

Attempts:

3 left

💡 Hint

Common Mistakes

Using left shift instead of right shift.

Using bitwise AND or OR instead of shift.

Right shifting by 2 bits divides the number by 4.

4fill in blank

hard

Fill both blanks to toggle the 3rd bit of a number.

DSA Java

int mask = 1 [1] 2;
int result = number [2] mask;

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

A<<

B&

C^

D|

Attempts:

3 left

💡 Hint

Common Mistakes

Using AND or OR instead of XOR to toggle.

Incorrect bit shift amount.

Shift 1 left by 2 to create mask for 3rd bit, then XOR toggles that bit.

5fill in blank

hard

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

DSA Java

int setMask = 1 [1] 4;
int clearMask = ~(1 [2] 1);
int result = (number [3] setMask) & clearMask;

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

A<<

C&

D|

Attempts:

3 left

💡 Hint

Common Mistakes

Mixing up shift amounts.

Using AND instead of OR to set bits.

Not negating the clear mask.

Shift 1 left by 4 for 5th bit mask, shift 1 left by 1 for 2nd bit mask, OR to set bit, AND with negated mask to clear bit.

Practice

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

easy

A. Because arithmetic operations use less memory

B. Because bit manipulation works directly on binary digits using simple CPU instructions

C. Because bit manipulation requires more CPU cycles

D. Because arithmetic operations are always done in parallel

Solution

1. Step 1: Understand CPU operations

   Bit manipulation uses simple CPU instructions like shifts and AND/OR, which are very fast.

2. Step 2: Compare with arithmetic operations

   Multiplication and division are more complex and take more CPU cycles than bit operations.

3. Final Answer:

   Because bit manipulation works directly on binary digits using simple CPU instructions -> Option B

4. Quick Check:

   Bit manipulation = faster CPU instructions [OK]

Hint: Bit ops use simple CPU steps, arithmetic uses complex steps [OK]

Common Mistakes:

• Thinking arithmetic is always faster
• Confusing memory use with speed
• Assuming bit ops use more CPU cycles

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

easy

A. x << 3

B. x >> 3

C. x & 8

D. x | 8

Solution

1. Step 1: Recall bit shift meaning

   Left shift by 3 (<< 3) multiplies by 2^3 = 8.

2. Step 2: Check other options

   Right shift divides, AND and OR do not multiply.

3. Final Answer:

   x << 3 -> Option A

4. Quick Check:

   Left shift 3 = multiply by 8 [OK]

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

Common Mistakes:

• Using right shift instead of left shift
• Using bitwise AND or OR for multiplication
• Confusing shift counts

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

int x = 12;
int y = x >> 2;
System.out.println(y);

medium

A. 6

B. 48

C. 3

D. 0

Solution

1. Step 1: Understand right shift operation

   Right shifting by 2 divides the number by 2^2 = 4, dropping remainder.

2. Step 2: Calculate value

   12 divided by 4 is 3, so y = 3.

3. Final Answer:

   3 -> Option C

4. Quick Check:

   12 >> 2 = 3 [OK]

Hint: Right shift by n divides by 2^n (integer division) [OK]

Common Mistakes:

• Thinking right shift multiplies
• Confusing left and right shifts
• Expecting decimal division result

4. The following Java code intends to check if a number n is even using bit manipulation. Find the error:

if ((n & 1) == 1) {
    System.out.println("Even");
} else {
    System.out.println("Odd");
}

medium

A. The print statements are reversed

B. The bitwise AND operator & is incorrect here

C. The code should use left shift instead of AND

D. The condition should check for 0 to identify even numbers

Solution

1. Step 1: Understand bitwise check for even

   Even numbers have last bit 0, so n & 1 equals 0 for even.

2. Step 2: Check condition logic

   The code prints "Even" when n & 1 == 1, which is true for odd numbers.

3. Final Answer:

   The condition should check for 0 to identify even numbers -> Option D

4. Quick Check:

   Even if (n & 1) == 0 [OK]

Hint: Even numbers have last bit 0, check (n & 1) == 0 [OK]

Common Mistakes:

• Checking (n & 1) == 1 for even
• Using wrong bitwise operator
• Swapping print messages

5. You want to quickly check if an integer num is a power of two using bit manipulation in Java. Which expression correctly does this and why is it faster than using loops or division?

boolean isPowerOfTwo = (num & (num - 1)) == 0;

hard

A. It returns true only if num has exactly one bit set, faster than loops

B. It counts bits in num, slower than division

C. It shifts num right until zero, same speed as loops

D. It uses arithmetic multiplication internally

Solution

1. Step 1: Understand the bit trick

   For powers of two, only one bit is set. num & (num - 1) clears the lowest set bit.

2. Step 2: Explain why it works and speed

   If result is zero, num had one bit set, so it's a power of two. This uses simple bit ops, faster than loops or division.

3. Final Answer:

   It returns true only if num has exactly one bit set, faster than loops -> Option A

4. Quick Check:

   Power of two check uses bit trick = true [OK]

Hint: Power of two if num & (num-1) == 0 [OK]

Common Mistakes:

• Thinking it counts bits
• Using loops instead of bit ops
• Confusing with multiplication