01How Computers Work
Practice library / Bitwise logic

Fully solved problem book

Bitwise logic

Set 8 of 9 · 32 worked questions. Predict your result before expanding the solution.

These worked traces are meant to build fluency through controlled variation. If several answers feel identical, try the next difficult value and look for the point where a carry, sign, branch, or selected memory address changes the outcome.

Boolean logic · Problem 0225

Calculate 11010001 XOR 10011101.

Try it on paper first. The worked answer is hidden below.

Reveal detailed solution →
  1. A is the eight-bit string 11010001.
  2. B is the eight-bit string 10011101.
  3. The operation is XOR, applied separately to each matching bit position.
  4. Position 7 (weight 128): XOR(1, 1) = 0.
  5. Position 6 (weight 64): XOR(1, 0) = 1.
  6. Position 5 (weight 32): XOR(0, 0) = 0.
  7. Position 4 (weight 16): XOR(1, 1) = 0.
  8. Position 3 (weight 8): XOR(0, 1) = 1.
  9. Position 2 (weight 4): XOR(0, 1) = 1.
  10. Position 1 (weight 2): XOR(0, 0) = 0.
  11. Position 0 (weight 1): XOR(1, 1) = 0.
  12. Concatenate the output bits from position seven to zero: 01001100.
  13. The output is 76 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise XOR operation.

Final answer: 01001100

Boolean logic · Problem 0226

Calculate 11010010 XOR 00011110.

Try it on paper first. The worked answer is hidden below.

Reveal detailed solution →
  1. A is the eight-bit string 11010010.
  2. B is the eight-bit string 00011110.
  3. The operation is XOR, applied separately to each matching bit position.
  4. Position 7 (weight 128): XOR(1, 0) = 1.
  5. Position 6 (weight 64): XOR(1, 0) = 1.
  6. Position 5 (weight 32): XOR(0, 0) = 0.
  7. Position 4 (weight 16): XOR(1, 1) = 0.
  8. Position 3 (weight 8): XOR(0, 1) = 1.
  9. Position 2 (weight 4): XOR(0, 1) = 1.
  10. Position 1 (weight 2): XOR(1, 1) = 0.
  11. Position 0 (weight 1): XOR(0, 0) = 0.
  12. Concatenate the output bits from position seven to zero: 11001100.
  13. The output is 204 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise XOR operation.

Final answer: 11001100

Boolean logic · Problem 0227

Calculate 11010010 XOR 11101000.

Try it on paper first. The worked answer is hidden below.

Reveal detailed solution →
  1. A is the eight-bit string 11010010.
  2. B is the eight-bit string 11101000.
  3. The operation is XOR, applied separately to each matching bit position.
  4. Position 7 (weight 128): XOR(1, 1) = 0.
  5. Position 6 (weight 64): XOR(1, 1) = 0.
  6. Position 5 (weight 32): XOR(0, 1) = 1.
  7. Position 4 (weight 16): XOR(1, 0) = 1.
  8. Position 3 (weight 8): XOR(0, 1) = 1.
  9. Position 2 (weight 4): XOR(0, 0) = 0.
  10. Position 1 (weight 2): XOR(1, 0) = 1.
  11. Position 0 (weight 1): XOR(0, 0) = 0.
  12. Concatenate the output bits from position seven to zero: 00111010.
  13. The output is 58 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise XOR operation.

Final answer: 00111010

Boolean logic · Problem 0228

Calculate 11010011 XOR 11110101.

Try it on paper first. The worked answer is hidden below.

Reveal detailed solution →
  1. A is the eight-bit string 11010011.
  2. B is the eight-bit string 11110101.
  3. The operation is XOR, applied separately to each matching bit position.
  4. Position 7 (weight 128): XOR(1, 1) = 0.
  5. Position 6 (weight 64): XOR(1, 1) = 0.
  6. Position 5 (weight 32): XOR(0, 1) = 1.
  7. Position 4 (weight 16): XOR(1, 1) = 0.
  8. Position 3 (weight 8): XOR(0, 0) = 0.
  9. Position 2 (weight 4): XOR(0, 1) = 1.
  10. Position 1 (weight 2): XOR(1, 0) = 1.
  11. Position 0 (weight 1): XOR(1, 1) = 0.
  12. Concatenate the output bits from position seven to zero: 00100110.
  13. The output is 38 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise XOR operation.

Final answer: 00100110

Boolean logic · Problem 0229

Calculate 11010100 AND 00001110.

Try it on paper first. The worked answer is hidden below.

Reveal detailed solution →
  1. A is the eight-bit string 11010100.
  2. B is the eight-bit string 00001110.
  3. The operation is AND, applied separately to each matching bit position.
  4. Position 7 (weight 128): AND(1, 0) = 0.
  5. Position 6 (weight 64): AND(1, 0) = 0.
  6. Position 5 (weight 32): AND(0, 0) = 0.
  7. Position 4 (weight 16): AND(1, 0) = 0.
  8. Position 3 (weight 8): AND(0, 1) = 0.
  9. Position 2 (weight 4): AND(1, 1) = 1.
  10. Position 1 (weight 2): AND(0, 1) = 0.
  11. Position 0 (weight 1): AND(0, 0) = 0.
  12. Concatenate the output bits from position seven to zero: 00000100.
  13. The output is 4 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise AND operation.

Final answer: 00000100

Boolean logic · Problem 0230

Calculate 11010100 AND 00111001.

Try it on paper first. The worked answer is hidden below.

Reveal detailed solution →
  1. A is the eight-bit string 11010100.
  2. B is the eight-bit string 00111001.
  3. The operation is AND, applied separately to each matching bit position.
  4. Position 7 (weight 128): AND(1, 0) = 0.
  5. Position 6 (weight 64): AND(1, 0) = 0.
  6. Position 5 (weight 32): AND(0, 1) = 0.
  7. Position 4 (weight 16): AND(1, 1) = 1.
  8. Position 3 (weight 8): AND(0, 1) = 0.
  9. Position 2 (weight 4): AND(1, 0) = 0.
  10. Position 1 (weight 2): AND(0, 0) = 0.
  11. Position 0 (weight 1): AND(0, 1) = 0.
  12. Concatenate the output bits from position seven to zero: 00010000.
  13. The output is 16 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise AND operation.

Final answer: 00010000

Boolean logic · Problem 0231

Calculate 11010100 OR 01011011.

Try it on paper first. The worked answer is hidden below.

Reveal detailed solution →
  1. A is the eight-bit string 11010100.
  2. B is the eight-bit string 01011011.
  3. The operation is OR, applied separately to each matching bit position.
  4. Position 7 (weight 128): OR(1, 0) = 1.
  5. Position 6 (weight 64): OR(1, 1) = 1.
  6. Position 5 (weight 32): OR(0, 0) = 0.
  7. Position 4 (weight 16): OR(1, 1) = 1.
  8. Position 3 (weight 8): OR(0, 1) = 1.
  9. Position 2 (weight 4): OR(1, 0) = 1.
  10. Position 1 (weight 2): OR(0, 1) = 1.
  11. Position 0 (weight 1): OR(0, 1) = 1.
  12. Concatenate the output bits from position seven to zero: 11011111.
  13. The output is 223 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise OR operation.

Final answer: 11011111

Boolean logic · Problem 0232

Calculate 11011000 OR 11011110.

Try it on paper first. The worked answer is hidden below.

Reveal detailed solution →
  1. A is the eight-bit string 11011000.
  2. B is the eight-bit string 11011110.
  3. The operation is OR, applied separately to each matching bit position.
  4. Position 7 (weight 128): OR(1, 1) = 1.
  5. Position 6 (weight 64): OR(1, 1) = 1.
  6. Position 5 (weight 32): OR(0, 0) = 0.
  7. Position 4 (weight 16): OR(1, 1) = 1.
  8. Position 3 (weight 8): OR(1, 1) = 1.
  9. Position 2 (weight 4): OR(0, 1) = 1.
  10. Position 1 (weight 2): OR(0, 1) = 1.
  11. Position 0 (weight 1): OR(0, 0) = 0.
  12. Concatenate the output bits from position seven to zero: 11011110.
  13. The output is 222 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise OR operation.

Final answer: 11011110

Boolean logic · Problem 0233

Calculate 11011001 AND 10011111.

Try it on paper first. The worked answer is hidden below.

Reveal detailed solution →
  1. A is the eight-bit string 11011001.
  2. B is the eight-bit string 10011111.
  3. The operation is AND, applied separately to each matching bit position.
  4. Position 7 (weight 128): AND(1, 1) = 1.
  5. Position 6 (weight 64): AND(1, 0) = 0.
  6. Position 5 (weight 32): AND(0, 0) = 0.
  7. Position 4 (weight 16): AND(1, 1) = 1.
  8. Position 3 (weight 8): AND(1, 1) = 1.
  9. Position 2 (weight 4): AND(0, 1) = 0.
  10. Position 1 (weight 2): AND(0, 1) = 0.
  11. Position 0 (weight 1): AND(1, 1) = 1.
  12. Concatenate the output bits from position seven to zero: 10011001.
  13. The output is 153 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise AND operation.

Final answer: 10011001

Boolean logic · Problem 0234

Calculate 11011010 XOR 01001001.

Try it on paper first. The worked answer is hidden below.

Reveal detailed solution →
  1. A is the eight-bit string 11011010.
  2. B is the eight-bit string 01001001.
  3. The operation is XOR, applied separately to each matching bit position.
  4. Position 7 (weight 128): XOR(1, 0) = 1.
  5. Position 6 (weight 64): XOR(1, 1) = 0.
  6. Position 5 (weight 32): XOR(0, 0) = 0.
  7. Position 4 (weight 16): XOR(1, 0) = 1.
  8. Position 3 (weight 8): XOR(1, 1) = 0.
  9. Position 2 (weight 4): XOR(0, 0) = 0.
  10. Position 1 (weight 2): XOR(1, 0) = 1.
  11. Position 0 (weight 1): XOR(0, 1) = 1.
  12. Concatenate the output bits from position seven to zero: 10010011.
  13. The output is 147 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise XOR operation.

Final answer: 10010011

Boolean logic · Problem 0235

Calculate 11011100 XOR 00000100.

Try it on paper first. The worked answer is hidden below.

Reveal detailed solution →
  1. A is the eight-bit string 11011100.
  2. B is the eight-bit string 00000100.
  3. The operation is XOR, applied separately to each matching bit position.
  4. Position 7 (weight 128): XOR(1, 0) = 1.
  5. Position 6 (weight 64): XOR(1, 0) = 1.
  6. Position 5 (weight 32): XOR(0, 0) = 0.
  7. Position 4 (weight 16): XOR(1, 0) = 1.
  8. Position 3 (weight 8): XOR(1, 0) = 1.
  9. Position 2 (weight 4): XOR(1, 1) = 0.
  10. Position 1 (weight 2): XOR(0, 0) = 0.
  11. Position 0 (weight 1): XOR(0, 0) = 0.
  12. Concatenate the output bits from position seven to zero: 11011000.
  13. The output is 216 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise XOR operation.

Final answer: 11011000

Boolean logic · Problem 0236

Calculate 11011100 XOR 10111111.

Try it on paper first. The worked answer is hidden below.

Reveal detailed solution →
  1. A is the eight-bit string 11011100.
  2. B is the eight-bit string 10111111.
  3. The operation is XOR, applied separately to each matching bit position.
  4. Position 7 (weight 128): XOR(1, 1) = 0.
  5. Position 6 (weight 64): XOR(1, 0) = 1.
  6. Position 5 (weight 32): XOR(0, 1) = 1.
  7. Position 4 (weight 16): XOR(1, 1) = 0.
  8. Position 3 (weight 8): XOR(1, 1) = 0.
  9. Position 2 (weight 4): XOR(1, 1) = 0.
  10. Position 1 (weight 2): XOR(0, 1) = 1.
  11. Position 0 (weight 1): XOR(0, 1) = 1.
  12. Concatenate the output bits from position seven to zero: 01100011.
  13. The output is 99 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise XOR operation.

Final answer: 01100011

Boolean logic · Problem 0237

Calculate 11011101 XOR 01100101.

Try it on paper first. The worked answer is hidden below.

Reveal detailed solution →
  1. A is the eight-bit string 11011101.
  2. B is the eight-bit string 01100101.
  3. The operation is XOR, applied separately to each matching bit position.
  4. Position 7 (weight 128): XOR(1, 0) = 1.
  5. Position 6 (weight 64): XOR(1, 1) = 0.
  6. Position 5 (weight 32): XOR(0, 1) = 1.
  7. Position 4 (weight 16): XOR(1, 0) = 1.
  8. Position 3 (weight 8): XOR(1, 0) = 1.
  9. Position 2 (weight 4): XOR(1, 1) = 0.
  10. Position 1 (weight 2): XOR(0, 0) = 0.
  11. Position 0 (weight 1): XOR(1, 1) = 0.
  12. Concatenate the output bits from position seven to zero: 10111000.
  13. The output is 184 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise XOR operation.

Final answer: 10111000

Boolean logic · Problem 0238

Calculate 11011101 AND 10111000.

Try it on paper first. The worked answer is hidden below.

Reveal detailed solution →
  1. A is the eight-bit string 11011101.
  2. B is the eight-bit string 10111000.
  3. The operation is AND, applied separately to each matching bit position.
  4. Position 7 (weight 128): AND(1, 1) = 1.
  5. Position 6 (weight 64): AND(1, 0) = 0.
  6. Position 5 (weight 32): AND(0, 1) = 0.
  7. Position 4 (weight 16): AND(1, 1) = 1.
  8. Position 3 (weight 8): AND(1, 1) = 1.
  9. Position 2 (weight 4): AND(1, 0) = 0.
  10. Position 1 (weight 2): AND(0, 0) = 0.
  11. Position 0 (weight 1): AND(1, 0) = 0.
  12. Concatenate the output bits from position seven to zero: 10011000.
  13. The output is 152 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise AND operation.

Final answer: 10011000

Boolean logic · Problem 0239

Calculate 11011111 XOR 10100011.

Try it on paper first. The worked answer is hidden below.

Reveal detailed solution →
  1. A is the eight-bit string 11011111.
  2. B is the eight-bit string 10100011.
  3. The operation is XOR, applied separately to each matching bit position.
  4. Position 7 (weight 128): XOR(1, 1) = 0.
  5. Position 6 (weight 64): XOR(1, 0) = 1.
  6. Position 5 (weight 32): XOR(0, 1) = 1.
  7. Position 4 (weight 16): XOR(1, 0) = 1.
  8. Position 3 (weight 8): XOR(1, 0) = 1.
  9. Position 2 (weight 4): XOR(1, 0) = 1.
  10. Position 1 (weight 2): XOR(1, 1) = 0.
  11. Position 0 (weight 1): XOR(1, 1) = 0.
  12. Concatenate the output bits from position seven to zero: 01111100.
  13. The output is 124 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise XOR operation.

Final answer: 01111100

Boolean logic · Problem 0240

Calculate 11100000 AND 01011100.

Try it on paper first. The worked answer is hidden below.

Reveal detailed solution →
  1. A is the eight-bit string 11100000.
  2. B is the eight-bit string 01011100.
  3. The operation is AND, applied separately to each matching bit position.
  4. Position 7 (weight 128): AND(1, 0) = 0.
  5. Position 6 (weight 64): AND(1, 1) = 1.
  6. Position 5 (weight 32): AND(1, 0) = 0.
  7. Position 4 (weight 16): AND(0, 1) = 0.
  8. Position 3 (weight 8): AND(0, 1) = 0.
  9. Position 2 (weight 4): AND(0, 1) = 0.
  10. Position 1 (weight 2): AND(0, 0) = 0.
  11. Position 0 (weight 1): AND(0, 0) = 0.
  12. Concatenate the output bits from position seven to zero: 01000000.
  13. The output is 64 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise AND operation.

Final answer: 01000000

Boolean logic · Problem 0241

Calculate 11100010 XOR 01000000.

Try it on paper first. The worked answer is hidden below.

Reveal detailed solution →
  1. A is the eight-bit string 11100010.
  2. B is the eight-bit string 01000000.
  3. The operation is XOR, applied separately to each matching bit position.
  4. Position 7 (weight 128): XOR(1, 0) = 1.
  5. Position 6 (weight 64): XOR(1, 1) = 0.
  6. Position 5 (weight 32): XOR(1, 0) = 1.
  7. Position 4 (weight 16): XOR(0, 0) = 0.
  8. Position 3 (weight 8): XOR(0, 0) = 0.
  9. Position 2 (weight 4): XOR(0, 0) = 0.
  10. Position 1 (weight 2): XOR(1, 0) = 1.
  11. Position 0 (weight 1): XOR(0, 0) = 0.
  12. Concatenate the output bits from position seven to zero: 10100010.
  13. The output is 162 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise XOR operation.

Final answer: 10100010

Boolean logic · Problem 0242

Calculate 11100010 AND 10101011.

Try it on paper first. The worked answer is hidden below.

Reveal detailed solution →
  1. A is the eight-bit string 11100010.
  2. B is the eight-bit string 10101011.
  3. The operation is AND, applied separately to each matching bit position.
  4. Position 7 (weight 128): AND(1, 1) = 1.
  5. Position 6 (weight 64): AND(1, 0) = 0.
  6. Position 5 (weight 32): AND(1, 1) = 1.
  7. Position 4 (weight 16): AND(0, 0) = 0.
  8. Position 3 (weight 8): AND(0, 1) = 0.
  9. Position 2 (weight 4): AND(0, 0) = 0.
  10. Position 1 (weight 2): AND(1, 1) = 1.
  11. Position 0 (weight 1): AND(0, 1) = 0.
  12. Concatenate the output bits from position seven to zero: 10100010.
  13. The output is 162 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise AND operation.

Final answer: 10100010

Boolean logic · Problem 0243

Calculate 11100011 OR 10111110.

Try it on paper first. The worked answer is hidden below.

Reveal detailed solution →
  1. A is the eight-bit string 11100011.
  2. B is the eight-bit string 10111110.
  3. The operation is OR, applied separately to each matching bit position.
  4. Position 7 (weight 128): OR(1, 1) = 1.
  5. Position 6 (weight 64): OR(1, 0) = 1.
  6. Position 5 (weight 32): OR(1, 1) = 1.
  7. Position 4 (weight 16): OR(0, 1) = 1.
  8. Position 3 (weight 8): OR(0, 1) = 1.
  9. Position 2 (weight 4): OR(0, 1) = 1.
  10. Position 1 (weight 2): OR(1, 1) = 1.
  11. Position 0 (weight 1): OR(1, 0) = 1.
  12. Concatenate the output bits from position seven to zero: 11111111.
  13. The output is 255 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise OR operation.

Final answer: 11111111

Boolean logic · Problem 0244

Calculate 11100100 AND 11110110.

Try it on paper first. The worked answer is hidden below.

Reveal detailed solution →
  1. A is the eight-bit string 11100100.
  2. B is the eight-bit string 11110110.
  3. The operation is AND, applied separately to each matching bit position.
  4. Position 7 (weight 128): AND(1, 1) = 1.
  5. Position 6 (weight 64): AND(1, 1) = 1.
  6. Position 5 (weight 32): AND(1, 1) = 1.
  7. Position 4 (weight 16): AND(0, 1) = 0.
  8. Position 3 (weight 8): AND(0, 0) = 0.
  9. Position 2 (weight 4): AND(1, 1) = 1.
  10. Position 1 (weight 2): AND(0, 1) = 0.
  11. Position 0 (weight 1): AND(0, 0) = 0.
  12. Concatenate the output bits from position seven to zero: 11100100.
  13. The output is 228 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise AND operation.

Final answer: 11100100

Boolean logic · Problem 0245

Calculate 11100111 AND 01010100.

Try it on paper first. The worked answer is hidden below.

Reveal detailed solution →
  1. A is the eight-bit string 11100111.
  2. B is the eight-bit string 01010100.
  3. The operation is AND, applied separately to each matching bit position.
  4. Position 7 (weight 128): AND(1, 0) = 0.
  5. Position 6 (weight 64): AND(1, 1) = 1.
  6. Position 5 (weight 32): AND(1, 0) = 0.
  7. Position 4 (weight 16): AND(0, 1) = 0.
  8. Position 3 (weight 8): AND(0, 0) = 0.
  9. Position 2 (weight 4): AND(1, 1) = 1.
  10. Position 1 (weight 2): AND(1, 0) = 0.
  11. Position 0 (weight 1): AND(1, 0) = 0.
  12. Concatenate the output bits from position seven to zero: 01000100.
  13. The output is 68 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise AND operation.

Final answer: 01000100

Boolean logic · Problem 0246

Calculate 11100111 AND 10100000.

Try it on paper first. The worked answer is hidden below.

Reveal detailed solution →
  1. A is the eight-bit string 11100111.
  2. B is the eight-bit string 10100000.
  3. The operation is AND, applied separately to each matching bit position.
  4. Position 7 (weight 128): AND(1, 1) = 1.
  5. Position 6 (weight 64): AND(1, 0) = 0.
  6. Position 5 (weight 32): AND(1, 1) = 1.
  7. Position 4 (weight 16): AND(0, 0) = 0.
  8. Position 3 (weight 8): AND(0, 0) = 0.
  9. Position 2 (weight 4): AND(1, 0) = 0.
  10. Position 1 (weight 2): AND(1, 0) = 0.
  11. Position 0 (weight 1): AND(1, 0) = 0.
  12. Concatenate the output bits from position seven to zero: 10100000.
  13. The output is 160 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise AND operation.

Final answer: 10100000

Boolean logic · Problem 0247

Calculate 11101000 OR 10000000.

Try it on paper first. The worked answer is hidden below.

Reveal detailed solution →
  1. A is the eight-bit string 11101000.
  2. B is the eight-bit string 10000000.
  3. The operation is OR, applied separately to each matching bit position.
  4. Position 7 (weight 128): OR(1, 1) = 1.
  5. Position 6 (weight 64): OR(1, 0) = 1.
  6. Position 5 (weight 32): OR(1, 0) = 1.
  7. Position 4 (weight 16): OR(0, 0) = 0.
  8. Position 3 (weight 8): OR(1, 0) = 1.
  9. Position 2 (weight 4): OR(0, 0) = 0.
  10. Position 1 (weight 2): OR(0, 0) = 0.
  11. Position 0 (weight 1): OR(0, 0) = 0.
  12. Concatenate the output bits from position seven to zero: 11101000.
  13. The output is 232 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise OR operation.

Final answer: 11101000

Boolean logic · Problem 0248

Calculate 11101000 AND 10111111.

Try it on paper first. The worked answer is hidden below.

Reveal detailed solution →
  1. A is the eight-bit string 11101000.
  2. B is the eight-bit string 10111111.
  3. The operation is AND, applied separately to each matching bit position.
  4. Position 7 (weight 128): AND(1, 1) = 1.
  5. Position 6 (weight 64): AND(1, 0) = 0.
  6. Position 5 (weight 32): AND(1, 1) = 1.
  7. Position 4 (weight 16): AND(0, 1) = 0.
  8. Position 3 (weight 8): AND(1, 1) = 1.
  9. Position 2 (weight 4): AND(0, 1) = 0.
  10. Position 1 (weight 2): AND(0, 1) = 0.
  11. Position 0 (weight 1): AND(0, 1) = 0.
  12. Concatenate the output bits from position seven to zero: 10101000.
  13. The output is 168 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise AND operation.

Final answer: 10101000

Boolean logic · Problem 0249

Calculate 11101000 AND 11110011.

Try it on paper first. The worked answer is hidden below.

Reveal detailed solution →
  1. A is the eight-bit string 11101000.
  2. B is the eight-bit string 11110011.
  3. The operation is AND, applied separately to each matching bit position.
  4. Position 7 (weight 128): AND(1, 1) = 1.
  5. Position 6 (weight 64): AND(1, 1) = 1.
  6. Position 5 (weight 32): AND(1, 1) = 1.
  7. Position 4 (weight 16): AND(0, 1) = 0.
  8. Position 3 (weight 8): AND(1, 0) = 0.
  9. Position 2 (weight 4): AND(0, 0) = 0.
  10. Position 1 (weight 2): AND(0, 1) = 0.
  11. Position 0 (weight 1): AND(0, 1) = 0.
  12. Concatenate the output bits from position seven to zero: 11100000.
  13. The output is 224 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise AND operation.

Final answer: 11100000

Boolean logic · Problem 0250

Calculate 11101001 OR 00001111.

Try it on paper first. The worked answer is hidden below.

Reveal detailed solution →
  1. A is the eight-bit string 11101001.
  2. B is the eight-bit string 00001111.
  3. The operation is OR, applied separately to each matching bit position.
  4. Position 7 (weight 128): OR(1, 0) = 1.
  5. Position 6 (weight 64): OR(1, 0) = 1.
  6. Position 5 (weight 32): OR(1, 0) = 1.
  7. Position 4 (weight 16): OR(0, 0) = 0.
  8. Position 3 (weight 8): OR(1, 1) = 1.
  9. Position 2 (weight 4): OR(0, 1) = 1.
  10. Position 1 (weight 2): OR(0, 1) = 1.
  11. Position 0 (weight 1): OR(1, 1) = 1.
  12. Concatenate the output bits from position seven to zero: 11101111.
  13. The output is 239 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise OR operation.

Final answer: 11101111

Boolean logic · Problem 0251

Calculate 11101001 OR 11100001.

Try it on paper first. The worked answer is hidden below.

Reveal detailed solution →
  1. A is the eight-bit string 11101001.
  2. B is the eight-bit string 11100001.
  3. The operation is OR, applied separately to each matching bit position.
  4. Position 7 (weight 128): OR(1, 1) = 1.
  5. Position 6 (weight 64): OR(1, 1) = 1.
  6. Position 5 (weight 32): OR(1, 1) = 1.
  7. Position 4 (weight 16): OR(0, 0) = 0.
  8. Position 3 (weight 8): OR(1, 0) = 1.
  9. Position 2 (weight 4): OR(0, 0) = 0.
  10. Position 1 (weight 2): OR(0, 0) = 0.
  11. Position 0 (weight 1): OR(1, 1) = 1.
  12. Concatenate the output bits from position seven to zero: 11101001.
  13. The output is 233 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise OR operation.

Final answer: 11101001

Boolean logic · Problem 0252

Calculate 11101010 OR 00010100.

Try it on paper first. The worked answer is hidden below.

Reveal detailed solution →
  1. A is the eight-bit string 11101010.
  2. B is the eight-bit string 00010100.
  3. The operation is OR, applied separately to each matching bit position.
  4. Position 7 (weight 128): OR(1, 0) = 1.
  5. Position 6 (weight 64): OR(1, 0) = 1.
  6. Position 5 (weight 32): OR(1, 0) = 1.
  7. Position 4 (weight 16): OR(0, 1) = 1.
  8. Position 3 (weight 8): OR(1, 0) = 1.
  9. Position 2 (weight 4): OR(0, 1) = 1.
  10. Position 1 (weight 2): OR(1, 0) = 1.
  11. Position 0 (weight 1): OR(0, 0) = 0.
  12. Concatenate the output bits from position seven to zero: 11111110.
  13. The output is 254 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise OR operation.

Final answer: 11111110

Boolean logic · Problem 0253

Calculate 11101010 AND 10100000.

Try it on paper first. The worked answer is hidden below.

Reveal detailed solution →
  1. A is the eight-bit string 11101010.
  2. B is the eight-bit string 10100000.
  3. The operation is AND, applied separately to each matching bit position.
  4. Position 7 (weight 128): AND(1, 1) = 1.
  5. Position 6 (weight 64): AND(1, 0) = 0.
  6. Position 5 (weight 32): AND(1, 1) = 1.
  7. Position 4 (weight 16): AND(0, 0) = 0.
  8. Position 3 (weight 8): AND(1, 0) = 0.
  9. Position 2 (weight 4): AND(0, 0) = 0.
  10. Position 1 (weight 2): AND(1, 0) = 0.
  11. Position 0 (weight 1): AND(0, 0) = 0.
  12. Concatenate the output bits from position seven to zero: 10100000.
  13. The output is 160 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise AND operation.

Final answer: 10100000

Boolean logic · Problem 0254

Calculate 11101101 AND 11010000.

Try it on paper first. The worked answer is hidden below.

Reveal detailed solution →
  1. A is the eight-bit string 11101101.
  2. B is the eight-bit string 11010000.
  3. The operation is AND, applied separately to each matching bit position.
  4. Position 7 (weight 128): AND(1, 1) = 1.
  5. Position 6 (weight 64): AND(1, 1) = 1.
  6. Position 5 (weight 32): AND(1, 0) = 0.
  7. Position 4 (weight 16): AND(0, 1) = 0.
  8. Position 3 (weight 8): AND(1, 0) = 0.
  9. Position 2 (weight 4): AND(1, 0) = 0.
  10. Position 1 (weight 2): AND(0, 0) = 0.
  11. Position 0 (weight 1): AND(1, 0) = 0.
  12. Concatenate the output bits from position seven to zero: 11000000.
  13. The output is 192 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise AND operation.

Final answer: 11000000

Boolean logic · Problem 0255

Calculate 11101101 AND 11101101.

Try it on paper first. The worked answer is hidden below.

Reveal detailed solution →
  1. A is the eight-bit string 11101101.
  2. B is the eight-bit string 11101101.
  3. The operation is AND, applied separately to each matching bit position.
  4. Position 7 (weight 128): AND(1, 1) = 1.
  5. Position 6 (weight 64): AND(1, 1) = 1.
  6. Position 5 (weight 32): AND(1, 1) = 1.
  7. Position 4 (weight 16): AND(0, 0) = 0.
  8. Position 3 (weight 8): AND(1, 1) = 1.
  9. Position 2 (weight 4): AND(1, 1) = 1.
  10. Position 1 (weight 2): AND(0, 0) = 0.
  11. Position 0 (weight 1): AND(1, 1) = 1.
  12. Concatenate the output bits from position seven to zero: 11101101.
  13. The output is 237 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise AND operation.

Final answer: 11101101

Boolean logic · Problem 0256

Calculate 11110000 OR 10111110.

Try it on paper first. The worked answer is hidden below.

Reveal detailed solution →
  1. A is the eight-bit string 11110000.
  2. B is the eight-bit string 10111110.
  3. The operation is OR, applied separately to each matching bit position.
  4. Position 7 (weight 128): OR(1, 1) = 1.
  5. Position 6 (weight 64): OR(1, 0) = 1.
  6. Position 5 (weight 32): OR(1, 1) = 1.
  7. Position 4 (weight 16): OR(1, 1) = 1.
  8. Position 3 (weight 8): OR(0, 1) = 1.
  9. Position 2 (weight 4): OR(0, 1) = 1.
  10. Position 1 (weight 2): OR(0, 1) = 1.
  11. Position 0 (weight 1): OR(0, 0) = 0.
  12. Concatenate the output bits from position seven to zero: 11111110.
  13. The output is 254 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise OR operation.

Final answer: 11111110