01How Computers Work
Practice library / Bitwise logic

Fully solved problem book

Bitwise logic

Set 6 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 0161

Calculate 10011011 OR 01101001.

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

Reveal detailed solution →
  1. A is the eight-bit string 10011011.
  2. B is the eight-bit string 01101001.
  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(0, 1) = 1.
  6. Position 5 (weight 32): OR(0, 1) = 1.
  7. Position 4 (weight 16): OR(1, 0) = 1.
  8. Position 3 (weight 8): OR(1, 1) = 1.
  9. Position 2 (weight 4): OR(0, 0) = 0.
  10. Position 1 (weight 2): OR(1, 0) = 1.
  11. Position 0 (weight 1): OR(1, 1) = 1.
  12. Concatenate the output bits from position seven to zero: 11111011.
  13. The output is 251 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise OR operation.

Final answer: 11111011

Boolean logic · Problem 0162

Calculate 10011011 XOR 10100000.

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

Reveal detailed solution →
  1. A is the eight-bit string 10011011.
  2. B is the eight-bit string 10100000.
  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(0, 0) = 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(0, 0) = 0.
  10. Position 1 (weight 2): XOR(1, 0) = 1.
  11. Position 0 (weight 1): XOR(1, 0) = 1.
  12. Concatenate the output bits from position seven to zero: 00111011.
  13. The output is 59 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise XOR operation.

Final answer: 00111011

Boolean logic · Problem 0163

Calculate 10011100 OR 01010101.

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

Reveal detailed solution →
  1. A is the eight-bit string 10011100.
  2. B is the eight-bit string 01010101.
  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(0, 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, 0) = 1.
  9. Position 2 (weight 4): OR(1, 1) = 1.
  10. Position 1 (weight 2): OR(0, 0) = 0.
  11. Position 0 (weight 1): OR(0, 1) = 1.
  12. Concatenate the output bits from position seven to zero: 11011101.
  13. The output is 221 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise OR operation.

Final answer: 11011101

Boolean logic · Problem 0164

Calculate 10011100 XOR 10001100.

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

Reveal detailed solution →
  1. A is the eight-bit string 10011100.
  2. B is the eight-bit string 10001100.
  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(0, 0) = 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(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: 00010000.
  13. The output is 16 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise XOR operation.

Final answer: 00010000

Boolean logic · Problem 0165

Calculate 10011101 OR 01001011.

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

Reveal detailed solution →
  1. A is the eight-bit string 10011101.
  2. B is the eight-bit string 01001011.
  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(0, 1) = 1.
  6. Position 5 (weight 32): OR(0, 0) = 0.
  7. Position 4 (weight 16): OR(1, 0) = 1.
  8. Position 3 (weight 8): OR(1, 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(1, 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 0166

Calculate 10011101 AND 01100000.

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

Reveal detailed solution →
  1. A is the eight-bit string 10011101.
  2. B is the eight-bit string 01100000.
  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(0, 1) = 0.
  6. Position 5 (weight 32): AND(0, 1) = 0.
  7. Position 4 (weight 16): AND(1, 0) = 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: 00000000.
  13. The output is 0 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise AND operation.

Final answer: 00000000

Boolean logic · Problem 0167

Calculate 10011101 AND 11001111.

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

Reveal detailed solution →
  1. A is the eight-bit string 10011101.
  2. B is the eight-bit string 11001111.
  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(0, 1) = 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(1, 1) = 1.
  9. Position 2 (weight 4): AND(1, 1) = 1.
  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: 10001101.
  13. The output is 141 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise AND operation.

Final answer: 10001101

Boolean logic · Problem 0168

Calculate 10011110 XOR 00110101.

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

Reveal detailed solution →
  1. A is the eight-bit string 10011110.
  2. B is the eight-bit string 00110101.
  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(0, 0) = 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(1, 0) = 1.
  9. Position 2 (weight 4): XOR(1, 1) = 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: 10101011.
  13. The output is 171 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise XOR operation.

Final answer: 10101011

Boolean logic · Problem 0169

Calculate 10011110 XOR 10010101.

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

Reveal detailed solution →
  1. A is the eight-bit string 10011110.
  2. B is the eight-bit string 10010101.
  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(0, 0) = 0.
  6. Position 5 (weight 32): XOR(0, 0) = 0.
  7. Position 4 (weight 16): XOR(1, 1) = 0.
  8. Position 3 (weight 8): XOR(1, 0) = 1.
  9. Position 2 (weight 4): XOR(1, 1) = 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: 00001011.
  13. The output is 11 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise XOR operation.

Final answer: 00001011

Boolean logic · Problem 0170

Calculate 10011111 AND 00111011.

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

Reveal detailed solution →
  1. A is the eight-bit string 10011111.
  2. B is the eight-bit string 00111011.
  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(0, 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(1, 1) = 1.
  11. Position 0 (weight 1): AND(1, 1) = 1.
  12. Concatenate the output bits from position seven to zero: 00011011.
  13. The output is 27 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise AND operation.

Final answer: 00011011

Boolean logic · Problem 0171

Calculate 10100000 AND 10010111.

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

Reveal detailed solution →
  1. A is the eight-bit string 10100000.
  2. B is the eight-bit string 10010111.
  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(0, 0) = 0.
  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(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: 10000000.
  13. The output is 128 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise AND operation.

Final answer: 10000000

Boolean logic · Problem 0172

Calculate 10100001 AND 00001000.

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

Reveal detailed solution →
  1. A is the eight-bit string 10100001.
  2. B is the eight-bit string 00001000.
  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(0, 0) = 0.
  6. Position 5 (weight 32): AND(1, 0) = 0.
  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(0, 0) = 0.
  11. Position 0 (weight 1): AND(1, 0) = 0.
  12. Concatenate the output bits from position seven to zero: 00000000.
  13. The output is 0 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise AND operation.

Final answer: 00000000

Boolean logic · Problem 0173

Calculate 10100001 XOR 00011100.

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

Reveal detailed solution →
  1. A is the eight-bit string 10100001.
  2. B is the eight-bit string 00011100.
  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(0, 0) = 0.
  6. Position 5 (weight 32): XOR(1, 0) = 1.
  7. Position 4 (weight 16): XOR(0, 1) = 1.
  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, 0) = 1.
  12. Concatenate the output bits from position seven to zero: 10111101.
  13. The output is 189 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise XOR operation.

Final answer: 10111101

Boolean logic · Problem 0174

Calculate 10100001 AND 01101000.

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

Reveal detailed solution →
  1. A is the eight-bit string 10100001.
  2. B is the eight-bit string 01101000.
  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(0, 1) = 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(0, 0) = 0.
  11. Position 0 (weight 1): AND(1, 0) = 0.
  12. Concatenate the output bits from position seven to zero: 00100000.
  13. The output is 32 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise AND operation.

Final answer: 00100000

Boolean logic · Problem 0175

Calculate 10100001 XOR 10011010.

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

Reveal detailed solution →
  1. A is the eight-bit string 10100001.
  2. B is the eight-bit string 10011010.
  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(0, 0) = 0.
  6. Position 5 (weight 32): XOR(1, 0) = 1.
  7. Position 4 (weight 16): XOR(0, 1) = 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(0, 1) = 1.
  11. Position 0 (weight 1): XOR(1, 0) = 1.
  12. Concatenate the output bits from position seven to zero: 00111011.
  13. The output is 59 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise XOR operation.

Final answer: 00111011

Boolean logic · Problem 0176

Calculate 10100010 XOR 00111011.

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

Reveal detailed solution →
  1. A is the eight-bit string 10100010.
  2. B is the eight-bit string 00111011.
  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(0, 0) = 0.
  6. Position 5 (weight 32): XOR(1, 1) = 0.
  7. Position 4 (weight 16): XOR(0, 1) = 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, 1) = 0.
  11. Position 0 (weight 1): XOR(0, 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 XOR operation.

Final answer: 10011001

Boolean logic · Problem 0177

Calculate 10100010 XOR 01001011.

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

Reveal detailed solution →
  1. A is the eight-bit string 10100010.
  2. B is the eight-bit string 01001011.
  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(0, 1) = 1.
  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, 1) = 1.
  9. Position 2 (weight 4): XOR(0, 0) = 0.
  10. Position 1 (weight 2): XOR(1, 1) = 0.
  11. Position 0 (weight 1): XOR(0, 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 XOR operation.

Final answer: 11101001

Boolean logic · Problem 0178

Calculate 10100010 OR 10100110.

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

Reveal detailed solution →
  1. A is the eight-bit string 10100010.
  2. B is the eight-bit string 10100110.
  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(0, 0) = 0.
  6. Position 5 (weight 32): OR(1, 1) = 1.
  7. Position 4 (weight 16): OR(0, 0) = 0.
  8. Position 3 (weight 8): OR(0, 0) = 0.
  9. Position 2 (weight 4): OR(0, 1) = 1.
  10. Position 1 (weight 2): OR(1, 1) = 1.
  11. Position 0 (weight 1): OR(0, 0) = 0.
  12. Concatenate the output bits from position seven to zero: 10100110.
  13. The output is 166 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise OR operation.

Final answer: 10100110

Boolean logic · Problem 0179

Calculate 10100100 OR 00011001.

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

Reveal detailed solution →
  1. A is the eight-bit string 10100100.
  2. B is the eight-bit string 00011001.
  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(0, 0) = 0.
  6. Position 5 (weight 32): OR(1, 0) = 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(1, 0) = 1.
  10. Position 1 (weight 2): OR(0, 0) = 0.
  11. Position 0 (weight 1): OR(0, 1) = 1.
  12. Concatenate the output bits from position seven to zero: 10111101.
  13. The output is 189 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise OR operation.

Final answer: 10111101

Boolean logic · Problem 0180

Calculate 10100110 XOR 00111101.

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

Reveal detailed solution →
  1. A is the eight-bit string 10100110.
  2. B is the eight-bit string 00111101.
  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(0, 0) = 0.
  6. Position 5 (weight 32): XOR(1, 1) = 0.
  7. Position 4 (weight 16): XOR(0, 1) = 1.
  8. Position 3 (weight 8): XOR(0, 1) = 1.
  9. Position 2 (weight 4): XOR(1, 1) = 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: 10011011.
  13. The output is 155 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise XOR operation.

Final answer: 10011011

Boolean logic · Problem 0181

Calculate 10100110 XOR 00111111.

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

Reveal detailed solution →
  1. A is the eight-bit string 10100110.
  2. B is the eight-bit string 00111111.
  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(0, 0) = 0.
  6. Position 5 (weight 32): XOR(1, 1) = 0.
  7. Position 4 (weight 16): XOR(0, 1) = 1.
  8. Position 3 (weight 8): XOR(0, 1) = 1.
  9. Position 2 (weight 4): XOR(1, 1) = 0.
  10. Position 1 (weight 2): XOR(1, 1) = 0.
  11. Position 0 (weight 1): XOR(0, 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 XOR operation.

Final answer: 10011001

Boolean logic · Problem 0182

Calculate 10100111 OR 10001101.

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

Reveal detailed solution →
  1. A is the eight-bit string 10100111.
  2. B is the eight-bit string 10001101.
  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(0, 0) = 0.
  6. Position 5 (weight 32): OR(1, 0) = 1.
  7. Position 4 (weight 16): OR(0, 0) = 0.
  8. Position 3 (weight 8): OR(0, 1) = 1.
  9. Position 2 (weight 4): OR(1, 1) = 1.
  10. Position 1 (weight 2): OR(1, 0) = 1.
  11. Position 0 (weight 1): OR(1, 1) = 1.
  12. Concatenate the output bits from position seven to zero: 10101111.
  13. The output is 175 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise OR operation.

Final answer: 10101111

Boolean logic · Problem 0183

Calculate 10100111 AND 11011010.

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

Reveal detailed solution →
  1. A is the eight-bit string 10100111.
  2. B is the eight-bit string 11011010.
  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(0, 1) = 0.
  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(1, 0) = 0.
  10. Position 1 (weight 2): AND(1, 1) = 1.
  11. Position 0 (weight 1): AND(1, 0) = 0.
  12. Concatenate the output bits from position seven to zero: 10000010.
  13. The output is 130 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise AND operation.

Final answer: 10000010

Boolean logic · Problem 0184

Calculate 10100111 OR 11011110.

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

Reveal detailed solution →
  1. A is the eight-bit string 10100111.
  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(0, 1) = 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(0, 1) = 1.
  9. Position 2 (weight 4): OR(1, 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 0185

Calculate 10101000 OR 10001000.

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

Reveal detailed solution →
  1. A is the eight-bit string 10101000.
  2. B is the eight-bit string 10001000.
  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(0, 0) = 0.
  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, 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: 10101000.
  13. The output is 168 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise OR operation.

Final answer: 10101000

Boolean logic · Problem 0186

Calculate 10101000 XOR 11111101.

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

Reveal detailed solution →
  1. A is the eight-bit string 10101000.
  2. B is the eight-bit string 11111101.
  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(0, 1) = 1.
  6. Position 5 (weight 32): XOR(1, 1) = 0.
  7. Position 4 (weight 16): XOR(0, 1) = 1.
  8. Position 3 (weight 8): XOR(1, 1) = 0.
  9. Position 2 (weight 4): XOR(0, 1) = 1.
  10. Position 1 (weight 2): XOR(0, 0) = 0.
  11. Position 0 (weight 1): XOR(0, 1) = 1.
  12. Concatenate the output bits from position seven to zero: 01010101.
  13. The output is 85 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise XOR operation.

Final answer: 01010101

Boolean logic · Problem 0187

Calculate 10101001 XOR 11001011.

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

Reveal detailed solution →
  1. A is the eight-bit string 10101001.
  2. B is the eight-bit string 11001011.
  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(0, 1) = 1.
  6. Position 5 (weight 32): XOR(1, 0) = 1.
  7. Position 4 (weight 16): XOR(0, 0) = 0.
  8. Position 3 (weight 8): XOR(1, 1) = 0.
  9. Position 2 (weight 4): XOR(0, 0) = 0.
  10. Position 1 (weight 2): XOR(0, 1) = 1.
  11. Position 0 (weight 1): XOR(1, 1) = 0.
  12. Concatenate the output bits from position seven to zero: 01100010.
  13. The output is 98 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise XOR operation.

Final answer: 01100010

Boolean logic · Problem 0188

Calculate 10101010 OR 00000000.

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

Reveal detailed solution →
  1. A is the eight-bit string 10101010.
  2. B is the eight-bit string 00000000.
  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(0, 0) = 0.
  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(1, 0) = 1.
  11. Position 0 (weight 1): OR(0, 0) = 0.
  12. Concatenate the output bits from position seven to zero: 10101010.
  13. The output is 170 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise OR operation.

Final answer: 10101010

Boolean logic · Problem 0189

Calculate 10101011 OR 01100001.

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

Reveal detailed solution →
  1. A is the eight-bit string 10101011.
  2. B is the eight-bit string 01100001.
  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(0, 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(1, 0) = 1.
  11. Position 0 (weight 1): OR(1, 1) = 1.
  12. Concatenate the output bits from position seven to zero: 11101011.
  13. The output is 235 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise OR operation.

Final answer: 11101011

Boolean logic · Problem 0190

Calculate 10101100 XOR 00100000.

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

Reveal detailed solution →
  1. A is the eight-bit string 10101100.
  2. B is the eight-bit string 00100000.
  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(0, 0) = 0.
  6. Position 5 (weight 32): XOR(1, 1) = 0.
  7. Position 4 (weight 16): XOR(0, 0) = 0.
  8. Position 3 (weight 8): XOR(1, 0) = 1.
  9. Position 2 (weight 4): XOR(1, 0) = 1.
  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: 10001100.
  13. The output is 140 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise XOR operation.

Final answer: 10001100

Boolean logic · Problem 0191

Calculate 10101101 OR 00101111.

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

Reveal detailed solution →
  1. A is the eight-bit string 10101101.
  2. B is the eight-bit string 00101111.
  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(0, 0) = 0.
  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, 1) = 1.
  9. Position 2 (weight 4): OR(1, 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: 10101111.
  13. The output is 175 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise OR operation.

Final answer: 10101111

Boolean logic · Problem 0192

Calculate 10101101 OR 01001010.

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

Reveal detailed solution →
  1. A is the eight-bit string 10101101.
  2. B is the eight-bit string 01001010.
  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(0, 1) = 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(1, 0) = 1.
  10. Position 1 (weight 2): OR(0, 1) = 1.
  11. Position 0 (weight 1): OR(1, 0) = 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