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

Practice - 5 Tasks

1fill in blank

easy

Complete the code to double the number using bit manipulation.

DSA Python

result = num [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 arithmetic operators instead of bit shifts.

Shifting bits to the left by 1 (<< 1) multiplies the number by 2 efficiently.

2fill in blank

medium

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

DSA Python

is_even = (num [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 (|) instead of AND (&).

Using shift operators instead of bitwise AND.

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 Python

result = num [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 instead of toggling.

Using OR (|) which sets bits but does not toggle.

XOR (^) toggles the bit at the specified position without affecting others.

4fill in blank

hard

Fill both blanks to create a mask that clears the 4th bit of a number.

DSA Python

mask = ~(1 [1] 3)
result = num [2] mask

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

A<<

B&

C|

D^

Attempts:

3 left

💡 Hint

Common Mistakes

Using OR (|) instead of AND (&) to clear bits.

Not inverting the mask before AND operation.

Shift 1 left by 3 to target 4th bit, then invert mask and AND with number to clear that bit.

5fill in blank

hard

Fill all three blanks to extract bits 2 to 4 (inclusive) from a number.

DSA Python

mask = ((1 [1] 3) - 1) [2] (1 [3] 1)
result = (num & mask) >> 1

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

A<<

B&

C|

D>>

Attempts:

3 left

💡 Hint

Common Mistakes

Using AND (&) instead of OR (|) to combine mask parts.

Incorrect shift amounts causing wrong bits to be selected.

Shift 1 left by 3, subtract 1 to set bits 0-2, left shift by (1 | 1)=1 to position mask at bits 1-3 (0-based, i.e., 2nd-4th bits 1-based), AND extracts them, >>1 aligns to lowest bits.

Practice

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

easy

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

B. Because arithmetic operations use more memory than bit manipulation

C. Because bit manipulation uses floating-point calculations

D. Because arithmetic operations are not supported by modern CPUs

Solution

1. Step 1: Understand how bit manipulation works

   Bit manipulation changes individual bits using CPU instructions like AND, OR, XOR, shifts.

2. Step 2: Compare with arithmetic operations

   Arithmetic like multiplication/division involves more complex CPU cycles and calculations.

3. Final Answer:

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

4. Quick Check:

   Bit manipulation = direct CPU bit operations [OK]

Hint: Bit ops use CPU bits directly, arithmetic uses slower math [OK]

Common Mistakes:

• Thinking bit manipulation uses more memory
• Confusing bit manipulation with floating-point math
• Believing CPUs don't support arithmetic

2. Which of the following is the correct syntax to left shift the integer num by 3 bits in Python?

easy

A. num >><< 3

B. num >> 3

C. num <<< 3

D. num << 3

Solution

1. Step 1: Recall Python bit shift operators

   Left shift is done with << and right shift with >> in Python.

2. Step 2: Identify correct syntax

   Only num << 3 correctly shifts bits left by 3 places.

3. Final Answer:

   num << 3 -> Option D

4. Quick Check:

   Left shift = << operator [OK]

Hint: Use << for left shift, >> for right shift in Python [OK]

Common Mistakes:

• Using >>> which is invalid in Python
• Confusing left and right shift operators
• Adding extra symbols like >>>>

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

num = 10
result = num & 7
print(result)

medium

A. 2

B. 3

C. 6

D. 7

Solution

1. Step 1: Convert numbers to binary

   10 in binary is 1010, 7 is 0111.

2. Step 2: Perform bitwise AND operation

   1010 & 0111 = 0010 (binary) which is 2 in decimal.

3. Final Answer:

   2 -> Option A

4. Quick Check:

   10 & 7 = 2 [OK]

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

Common Mistakes:

• Confusing AND with OR operation
• Calculating decimal addition instead of bitwise AND
• Misreading binary values

4. Find the error in this Python code snippet that tries to divide a number by 2 using bit manipulation:

num = 15
result = num >> 1
print(result)

medium

A. num must be converted to string first

B. Should use << instead of >> to divide

C. No error, code correctly divides by 2

D. Bitwise AND needed before shifting

Solution

1. Step 1: Understand right shift operation

   Right shifting by 1 bit divides an integer by 2 (floor division).

2. Step 2: Check code correctness

   Code shifts 15 (1111 binary) right by 1 bit to get 7 (0111 binary), which is correct.

3. Final Answer:

   No error, code correctly divides by 2 -> Option C

4. Quick Check:

   Right shift by 1 = divide by 2 [OK]

Hint: Right shift by 1 divides integer by 2 [OK]

Common Mistakes:

• Thinking left shift divides instead of multiplies
• Adding unnecessary bitwise AND
• Trying to convert number to string before shifting

5. You want to check if a number n is a power of two using bit manipulation. Which expression correctly returns True if n is a power of two and False otherwise?

hard

A. n | (n - 1) == 0

B. n & (n - 1) == 0 and n != 0

C. n ^ (n + 1) == 0

D. n << 1 == n * 2

Solution

1. Step 1: Understand power of two property

   A power of two has exactly one bit set, so n & (n-1) clears that bit and results in zero.

2. Step 2: Check expression validity

   Expression n & (n - 1) == 0 and n != 0 returns True only for powers of two and excludes zero.

3. Final Answer:

   n & (n - 1) == 0 and n != 0 -> Option B

4. Quick Check:

   Power of two check = n & (n-1) == 0 [OK]

Hint: Power of two: n & (n-1) equals zero [OK]

Common Mistakes:

• Using OR or XOR instead of AND
• Not excluding zero as a special case
• Confusing left shift with power check