Bird
Raised Fist0
Rustprogramming~20 mins

Bitwise operators in Rust - Mini Project: Build & Apply

Choose your learning style10 modes available
Bitwise Operators in Rust
๐Ÿ“– Scenario: You are working with a simple device that uses flags represented by bits in a number. Each bit can be on (1) or off (0). You want to learn how to use bitwise operators to check and change these flags.
๐ŸŽฏ Goal: Build a Rust program that uses bitwise operators to manipulate flags stored in an integer. You will create the flags, set a mask, apply bitwise AND to check flags, and print the result.
๐Ÿ“‹ What You'll Learn
Create a variable with a specific integer value representing flags
Create a mask variable to select certain bits
Use the bitwise AND operator to check which flags are set
Print the result of the bitwise operation
๐Ÿ’ก Why This Matters
๐ŸŒ Real World
Bitwise operators are used in low-level programming, device control, and performance optimization where flags or settings are stored in bits.
๐Ÿ’ผ Career
Understanding bitwise operations is important for embedded systems, systems programming, and working with hardware interfaces.
Progress0 / 4 steps
1
Create the flags variable
Create a variable called flags and set it to the integer 0b101101 (binary for 45).
Rust
Hint

Use let flags = 0b101101; to create the variable with binary notation.

2
Create the mask variable
Add a variable called mask and set it to the integer 0b100100 (binary for 36).
Rust
Hint

Use let mask = 0b100100; to create the mask variable.

3
Apply bitwise AND to check flags
Create a variable called result and set it to the bitwise AND of flags and mask using the & operator.
Rust
Hint

Use let result = flags & mask; to apply bitwise AND.

4
Print the result
Add a println! statement to print the value of result in binary format using {:b}.
Rust
Hint

Use println!("{:b}", result); to print the binary result.

Practice

(1/5)
1. Which bitwise operator in Rust returns 1 only if both bits are 1?
Example: 5 & 3
easy
A. AND (&)
B. OR (|)
C. XOR (^)
D. NOT (!)

Solution

  1. Step 1: Understand the AND operator

    The AND operator (&) compares each bit of two numbers and returns 1 only if both bits are 1.
  2. Step 2: Compare with other operators

    OR (|) returns 1 if either bit is 1, XOR (^) returns 1 if bits differ, NOT (!) flips bits.
  3. Final Answer:

    AND (&) -> Option A
  4. Quick Check:

    AND returns 1 only if both bits are 1 [OK]
Hint: AND is the only operator needing both bits as 1 [OK]
Common Mistakes:
  • Confusing AND with OR which returns 1 if either bit is 1
  • Thinking XOR returns 1 if both bits are 1
  • Using NOT (!) as a binary operator instead of unary
2. Which of the following is the correct syntax for a bitwise XOR operation in Rust between variables a and b?
easy
A. a ! b
B. a & b
C. a | b
D. a ^ b

Solution

  1. Step 1: Recall XOR operator symbol

    In Rust, the bitwise XOR operator is represented by the caret symbol (^).
  2. Step 2: Check other operators

    & is AND, | is OR, and ! is unary NOT, so only a ^ b is correct for XOR.
  3. Final Answer:

    a ^ b -> Option D
  4. Quick Check:

    XOR uses ^ symbol in Rust [OK]
Hint: XOR uses ^ symbol, not & or | [OK]
Common Mistakes:
  • Using & or | instead of ^ for XOR
  • Trying to use ! as a binary operator
  • Confusing syntax with other languages
3. What is the output of this Rust code?
let x = 0b1010;  // binary 10
let y = 0b1100;  // binary 12
let result = x | y;
println!("{:04b}", result);
medium
A. 1000
B. 1110
C. 0110
D. 1010

Solution

  1. Step 1: Convert binary to bits and apply OR

    x = 1010, y = 1100. OR (|) returns 1 if either bit is 1. 1010 | 1100 = 1110
  2. Step 2: Print result in 4-bit binary

    Result is 1110 in binary, which matches 1110.
  3. Final Answer:

    1110 -> Option B
  4. Quick Check:

    Bitwise OR of 1010 and 1100 = 1110 [OK]
Hint: OR sets bits where either input bit is 1 [OK]
Common Mistakes:
  • Mixing up OR with AND results
  • Reading binary digits incorrectly
  • Forgetting to print in binary format
4. Identify the error in this Rust code snippet:
let a = 0b1010;
let b = 0b0101;
let c = a && b;
println!("{}", c);
medium
A. Incorrect binary literal syntax
B. Missing semicolon after let b
C. Using && instead of & for bitwise AND
D. println! macro missing format specifier

Solution

  1. Step 1: Check operator usage

    The code uses && which is a logical AND, not bitwise AND. Bitwise AND uses &.
  2. Step 2: Verify other syntax

    Semicolons are present, binary literals are correct, and println! has a format specifier, so no errors there.
  3. Final Answer:

    Using && instead of & for bitwise AND -> Option C
  4. Quick Check:

    Bitwise AND uses & not && [OK]
Hint: Use & for bitwise AND, && is logical AND [OK]
Common Mistakes:
  • Confusing logical AND (&&) with bitwise AND (&)
  • Assuming binary literals need prefix changes
  • Missing format specifier in println! macro
5. Given a number n, which Rust expression flips (toggles) the 3rd bit (counting from 0) of n using bitwise operators?
hard
A. n ^ (1 << 3)
B. n & (1 << 3)
C. n | (1 << 3)
D. ~n & (1 << 3)

Solution

  1. Step 1: Understand bit flipping with XOR

    XOR (^) with 1 flips the bit: if bit is 0 it becomes 1, if 1 it becomes 0. Shifting 1 by 3 sets the mask for the 3rd bit.
  2. Step 2: Analyze other options

    & with mask clears bits except the 3rd bit, | sets the 3rd bit to 1, ~n & mask is unrelated to flipping a single bit.
  3. Final Answer:

    n ^ (1 << 3) -> Option A
  4. Quick Check:

    XOR with bit mask flips that bit [OK]
Hint: XOR with 1 at bit position flips that bit [OK]
Common Mistakes:
  • Using & or | which clear or set bits instead of flipping
  • Confusing ~ (NOT) usage
  • Not shifting 1 to correct bit position
Recommended

Ready to prove it?

Pass the test and this pattern moves unknown strong while earning +1 Grip toward your certificate.

10 questions~5 mineasy hard