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

Practice - 5 Tasks

1fill in blank

easy

Complete the code to multiply a number by 2 using bit manipulation.

DSA Rust

let x = 5;
let result = x [1] 1;
println!("{}", result);

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 addition (+) instead of bit shift.

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

2fill in blank

medium

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

DSA Rust

let x = 10;
let is_even = (x [1] 1) == 0;
println!("{}", is_even);

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 left shift (<<) which changes the number.

Using bitwise AND (&) with 1 checks the least significant bit to determine evenness.

3fill in blank

hard

Fix the error in the code to divide a number by 4 using bit manipulation.

DSA Rust

let x = 20;
let result = x [1] 2;
println!("{}", result);

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

A<<

B>>

C+

D-

Attempts:

3 left

💡 Hint

Common Mistakes

Using left shift (<<) which multiplies instead of divides.

Using addition or subtraction instead of bit shifts.

Right shifting (>> 2) divides the number by 4 by moving bits two places to the right.

4fill in blank

hard

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

DSA Rust

let x = 8;
let mask = 1 [1] 2;
let result = x [2] mask;
println!("{}", result);

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

A<<

B>>

C^

D&

Attempts:

3 left

💡 Hint

Common Mistakes

Using AND (&) instead of XOR (^) to toggle bits.

Shifting bits in the wrong direction.

Shift 1 left by 2 to create a mask for the 3rd bit, then XOR (^) toggles that bit.

5fill in blank

hard

Fill all three blanks to set the 5th bit of a number using bit manipulation.

DSA Rust

let x = 10;
let mask = 1 [1] 4;
let result = x [2] mask;
println!("{}", result);

// Check if 5th bit is set
let is_set = (result [3] mask) != 0;
println!("{}", is_set);

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

A<<

B|

C&

D^

Attempts:

3 left

💡 Hint

Common Mistakes

Using XOR (^) to set bits which toggles instead.

Using wrong shift amount for the mask.

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

Shift 1 left by 4 to create mask for 5th bit, use OR (|) to set the bit, and AND (&) to check if bit is set.

Practice

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

easy

A. Because bit manipulation requires complex loops and conditions

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

C. Because arithmetic operations are always done in software, not hardware

D. Because bit manipulation uses more memory than arithmetic

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 often 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 B

4. Quick Check:

   Bit ops faster than arithmetic = D [OK]

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

Common Mistakes:

• Thinking bit manipulation uses more memory
• Assuming arithmetic is always hardware-accelerated
• Believing bit manipulation is complex and slow

2. Which of the following Rust expressions correctly uses bit manipulation to check if a number n is even?

easy

A. n & 1 == 0

B. n | 1 == 0

C. n ^ 1 == 0

D. n << 1 == 0

Solution

1. Step 1: Understand bitwise AND for even check

   Checking if the least significant bit is 0 means the number is even. This is done by n & 1 == 0.

2. Step 2: Analyze other options

   n | 1 == 0 uses OR which sets the bit, so it won't check evenness. n ^ 1 == 0 uses XOR which toggles bits, not a check. n << 1 == 0 shifts bits left, changing the number.

3. Final Answer:

   n & 1 == 0 -> Option A

4. Quick Check:

   Even check uses n & 1 == 0 [OK]

Hint: Use & 1 == 0 to check even numbers quickly [OK]

Common Mistakes:

• Using OR or XOR instead of AND for checking bits
• Confusing left shift with bit check
• Forgetting to compare with zero

3. What is the output of this Rust code snippet?

let x = 10;
let y = x >> 1;
println!("{}", y);

medium

A. 20

B. 0

C. 5

D. 10

Solution

1. Step 1: Understand right shift operation

   Right shifting by 1 divides the number by 2, discarding remainder. So 10 >> 1 = 5.

2. Step 2: Confirm output of println!

   The variable y holds 5, so printing y outputs 5.

3. Final Answer:

   5 -> Option C

4. Quick Check:

   10 >> 1 = 5 [OK]

Hint: Right shift by 1 divides by 2 (floor) [OK]

Common Mistakes:

• Thinking right shift multiplies instead of divides
• Confusing left and right shift
• Expecting floating point division

4. Identify the bug in this Rust code that tries to toggle the 3rd bit of num:

let num = 8;
let toggled = num & (1 << 2);
println!("{}", toggled);

medium

A. The variable num should be mutable

B. The shift amount should be 3 instead of 2

C. The code should use OR (|) to toggle the bit

D. It should use XOR (^) instead of AND (&) to toggle the bit

Solution

1. Step 1: Understand toggling bits

   Toggling a bit means flipping it: 0 to 1 or 1 to 0. XOR (^) with a mask does this.

2. Step 2: Analyze the code

   The code uses AND (&) which only masks bits but does not toggle. So it does not flip the 3rd bit.

3. Final Answer:

   It should use XOR (^) instead of AND (&) to toggle the bit -> Option D

4. Quick Check:

   Toggling bit uses XOR (^) [OK]

Hint: Toggle bits with XOR (^) not AND (&) [OK]

Common Mistakes:

• Using AND instead of XOR for toggling
• Confusing toggle with set or clear
• Wrong bit shift index

5. You want to multiply an integer n by 8 using bit manipulation in Rust. Which expression is the most efficient and correct?

hard

A. n << 3

B. n >> 3

C. n * 8

D. n & 8

Solution

1. Step 1: Understand multiplication by powers of two

   Multiplying by 8 is the same as multiplying by 2^3, which can be done by left shifting by 3 bits.

2. Step 2: Analyze options

   n << 3 uses left shift by 3, which is efficient and correct. n >> 3 right shifts, which divides. n * 8 uses arithmetic multiplication, correct but slower. n & 8 uses AND which masks bits, incorrect.

3. Final Answer:

   n << 3 -> Option A

4. Quick Check:

   Multiply by 8 = left shift 3 [OK]

Hint: Multiply by 2^k with left shift << k [OK]

Common Mistakes:

• Using right shift instead of left shift
• Using AND instead of multiplication or shift
• Assuming arithmetic is always faster