01How Computers Work
Practice library / Bitwise logic

Fully solved problem book

Bitwise logic

Set 5 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 0129

Calculate 01110101 OR 01100110.

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

Reveal detailed solution →
  1. A is the eight-bit string 01110101.
  2. B is the eight-bit string 01100110.
  3. The operation is OR, applied separately to each matching bit position.
  4. Position 7 (weight 128): OR(0, 0) = 0.
  5. Position 6 (weight 64): OR(1, 1) = 1.
  6. Position 5 (weight 32): OR(1, 1) = 1.
  7. Position 4 (weight 16): OR(1, 0) = 1.
  8. Position 3 (weight 8): OR(0, 0) = 0.
  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, 0) = 1.
  12. Concatenate the output bits from position seven to zero: 01110111.
  13. The output is 119 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise OR operation.

Final answer: 01110111

Boolean logic · Problem 0130

Calculate 01111000 XOR 00011111.

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

Reveal detailed solution →
  1. A is the eight-bit string 01111000.
  2. B is the eight-bit string 00011111.
  3. The operation is XOR, applied separately to each matching bit position.
  4. Position 7 (weight 128): XOR(0, 0) = 0.
  5. Position 6 (weight 64): XOR(1, 0) = 1.
  6. Position 5 (weight 32): XOR(1, 0) = 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(0, 1) = 1.
  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: 01100111.
  13. The output is 103 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise XOR operation.

Final answer: 01100111

Boolean logic · Problem 0131

Calculate 01111000 XOR 01100011.

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

Reveal detailed solution →
  1. A is the eight-bit string 01111000.
  2. B is the eight-bit string 01100011.
  3. The operation is XOR, applied separately to each matching bit position.
  4. Position 7 (weight 128): XOR(0, 0) = 0.
  5. Position 6 (weight 64): XOR(1, 1) = 0.
  6. Position 5 (weight 32): XOR(1, 1) = 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(0, 0) = 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: 00011011.
  13. The output is 27 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise XOR operation.

Final answer: 00011011

Boolean logic · Problem 0132

Calculate 01111000 XOR 01110010.

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

Reveal detailed solution →
  1. A is the eight-bit string 01111000.
  2. B is the eight-bit string 01110010.
  3. The operation is XOR, applied separately to each matching bit position.
  4. Position 7 (weight 128): XOR(0, 0) = 0.
  5. Position 6 (weight 64): XOR(1, 1) = 0.
  6. Position 5 (weight 32): XOR(1, 1) = 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(0, 0) = 0.
  10. Position 1 (weight 2): XOR(0, 1) = 1.
  11. Position 0 (weight 1): XOR(0, 0) = 0.
  12. Concatenate the output bits from position seven to zero: 00001010.
  13. The output is 10 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise XOR operation.

Final answer: 00001010

Boolean logic · Problem 0133

Calculate 01111001 AND 01111000.

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

Reveal detailed solution →
  1. A is the eight-bit string 01111001.
  2. B is the eight-bit string 01111000.
  3. The operation is AND, applied separately to each matching bit position.
  4. Position 7 (weight 128): AND(0, 0) = 0.
  5. Position 6 (weight 64): AND(1, 1) = 1.
  6. Position 5 (weight 32): AND(1, 1) = 1.
  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, 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: 01111000.
  13. The output is 120 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise AND operation.

Final answer: 01111000

Boolean logic · Problem 0134

Calculate 01111001 OR 11111101.

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

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

Final answer: 11111101

Boolean logic · Problem 0135

Calculate 01111010 XOR 01001100.

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

Reveal detailed solution →
  1. A is the eight-bit string 01111010.
  2. B is the eight-bit string 01001100.
  3. The operation is XOR, applied separately to each matching bit position.
  4. Position 7 (weight 128): XOR(0, 0) = 0.
  5. Position 6 (weight 64): XOR(1, 1) = 0.
  6. Position 5 (weight 32): XOR(1, 0) = 1.
  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, 1) = 1.
  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: 00110110.
  13. The output is 54 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise XOR operation.

Final answer: 00110110

Boolean logic · Problem 0136

Calculate 01111010 OR 10111001.

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

Reveal detailed solution →
  1. A is the eight-bit string 01111010.
  2. B is the eight-bit string 10111001.
  3. The operation is OR, applied separately to each matching bit position.
  4. Position 7 (weight 128): OR(0, 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(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(0, 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 0137

Calculate 01111011 XOR 01000000.

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

Reveal detailed solution →
  1. A is the eight-bit string 01111011.
  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(0, 0) = 0.
  5. Position 6 (weight 64): XOR(1, 1) = 0.
  6. Position 5 (weight 32): XOR(1, 0) = 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 0138

Calculate 01111101 XOR 11100100.

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

Reveal detailed solution →
  1. A is the eight-bit string 01111101.
  2. B is the eight-bit string 11100100.
  3. The operation is XOR, applied separately to each matching bit position.
  4. Position 7 (weight 128): XOR(0, 1) = 1.
  5. Position 6 (weight 64): XOR(1, 1) = 0.
  6. Position 5 (weight 32): XOR(1, 1) = 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(1, 0) = 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 0139

Calculate 01111110 XOR 10001000.

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

Reveal detailed solution →
  1. A is the eight-bit string 01111110.
  2. B is the eight-bit string 10001000.
  3. The operation is XOR, applied separately to each matching bit position.
  4. Position 7 (weight 128): XOR(0, 1) = 1.
  5. Position 6 (weight 64): XOR(1, 0) = 1.
  6. Position 5 (weight 32): XOR(1, 0) = 1.
  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, 0) = 1.
  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: 11110110.
  13. The output is 246 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise XOR operation.

Final answer: 11110110

Boolean logic · Problem 0140

Calculate 10000000 XOR 11101110.

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

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

Final answer: 01101110

Boolean logic · Problem 0141

Calculate 10000010 OR 10011000.

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

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

Final answer: 10011010

Boolean logic · Problem 0142

Calculate 10000101 OR 11001111.

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

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

Final answer: 11001111

Boolean logic · Problem 0143

Calculate 10000101 XOR 11100000.

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

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

Final answer: 01100101

Boolean logic · Problem 0144

Calculate 10000111 AND 11000101.

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

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

Final answer: 10000101

Boolean logic · Problem 0145

Calculate 10000111 AND 11010111.

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

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

Final answer: 10000111

Boolean logic · Problem 0146

Calculate 10001000 AND 01100111.

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

Reveal detailed solution →
  1. A is the eight-bit string 10001000.
  2. B is the eight-bit string 01100111.
  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(0, 0) = 0.
  8. Position 3 (weight 8): AND(1, 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: 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 0147

Calculate 10001010 XOR 10000010.

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

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

Final answer: 00001000

Boolean logic · Problem 0148

Calculate 10001010 OR 11001011.

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

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

Final answer: 11001011

Boolean logic · Problem 0149

Calculate 10001011 AND 11001110.

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

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

Final answer: 10001010

Boolean logic · Problem 0150

Calculate 10010000 AND 10111110.

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

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

Final answer: 10010000

Boolean logic · Problem 0151

Calculate 10010101 XOR 00010000.

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

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

Final answer: 10000101

Boolean logic · Problem 0152

Calculate 10010101 AND 11000011.

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

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

Final answer: 10000001

Boolean logic · Problem 0153

Calculate 10010111 OR 00000011.

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

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

Final answer: 10010111

Boolean logic · Problem 0154

Calculate 10010111 OR 10000010.

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

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

Final answer: 10010111

Boolean logic · Problem 0155

Calculate 10010111 AND 10011111.

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

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

Final answer: 10010111

Boolean logic · Problem 0156

Calculate 10010111 OR 11100001.

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

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

Final answer: 11110111

Boolean logic · Problem 0157

Calculate 10011000 XOR 10010010.

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

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

Final answer: 00001010

Boolean logic · Problem 0158

Calculate 10011010 XOR 00100001.

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

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

Final answer: 10111011

Boolean logic · Problem 0159

Calculate 10011010 OR 01010101.

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

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

Calculate 10011011 XOR 01000100.

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 01000100.
  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(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(0, 1) = 1.
  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: 11011111.
  13. The output is 223 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise XOR operation.

Final answer: 11011111