01How Computers Work
Practice library / Bitwise logic

Fully solved problem book

Bitwise logic

Set 3 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 0065

Calculate 00111000 OR 10001000.

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

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

Final answer: 10111000

Boolean logic · Problem 0066

Calculate 00111000 OR 10001010.

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

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

Final answer: 10111010

Boolean logic · Problem 0067

Calculate 00111001 AND 00001001.

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

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

Final answer: 00001001

Boolean logic · Problem 0068

Calculate 00111001 AND 01001101.

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

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

Final answer: 00001001

Boolean logic · Problem 0069

Calculate 00111001 AND 11010100.

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

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

Final answer: 00010000

Boolean logic · Problem 0070

Calculate 00111010 AND 10100101.

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

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

Calculate 00111011 OR 10000100.

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

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

Final answer: 10111111

Boolean logic · Problem 0072

Calculate 00111011 XOR 11110100.

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

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

Final answer: 11001111

Boolean logic · Problem 0073

Calculate 00111100 XOR 01010011.

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

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

Final answer: 01101111

Boolean logic · Problem 0074

Calculate 00111101 AND 00001111.

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

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

Final answer: 00001101

Boolean logic · Problem 0075

Calculate 00111101 OR 01100000.

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

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

Final answer: 01111101

Boolean logic · Problem 0076

Calculate 00111101 OR 01100100.

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

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

Final answer: 01111101

Boolean logic · Problem 0077

Calculate 00111101 OR 01101110.

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

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

Final answer: 01111111

Boolean logic · Problem 0078

Calculate 00111101 XOR 10000000.

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

Reveal detailed solution →
  1. A is the eight-bit string 00111101.
  2. B is the eight-bit string 10000000.
  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(0, 0) = 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(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: 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 0079

Calculate 00111111 XOR 01001111.

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

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

Final answer: 01110000

Boolean logic · Problem 0080

Calculate 01000110 AND 00101001.

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

Reveal detailed solution →
  1. A is the eight-bit string 01000110.
  2. B is the eight-bit string 00101001.
  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, 0) = 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(0, 1) = 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(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 0081

Calculate 01001000 OR 10010101.

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

Reveal detailed solution →
  1. A is the eight-bit string 01001000.
  2. B is the eight-bit string 10010101.
  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(0, 0) = 0.
  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(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 0082

Calculate 01001000 AND 11001010.

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

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

Final answer: 01001000

Boolean logic · Problem 0083

Calculate 01001001 AND 01000010.

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

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

Calculate 01001011 XOR 01011001.

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

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

Final answer: 00010010

Boolean logic · Problem 0085

Calculate 01001011 OR 11001110.

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

Reveal detailed solution →
  1. A is the eight-bit string 01001011.
  2. B is the eight-bit string 11001110.
  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(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, 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: 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 0086

Calculate 01001111 XOR 01111011.

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

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

Final answer: 00110100

Boolean logic · Problem 0087

Calculate 01001111 AND 11011111.

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

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

Final answer: 01001111

Boolean logic · Problem 0088

Calculate 01010001 XOR 01011110.

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

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

Final answer: 00001111

Boolean logic · Problem 0089

Calculate 01010010 OR 01001010.

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

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

Final answer: 01011010

Boolean logic · Problem 0090

Calculate 01010010 OR 01100110.

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

Reveal detailed solution →
  1. A is the eight-bit string 01010010.
  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(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(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: 01110110.
  13. The output is 118 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise OR operation.

Final answer: 01110110

Boolean logic · Problem 0091

Calculate 01010010 XOR 11011100.

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

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

Final answer: 10001110

Boolean logic · Problem 0092

Calculate 01010011 OR 01100101.

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

Reveal detailed solution →
  1. A is the eight-bit string 01010011.
  2. B is the eight-bit string 01100101.
  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(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(0, 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: 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 0093

Calculate 01010011 XOR 11110010.

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

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

Final answer: 10100001

Boolean logic · Problem 0094

Calculate 01010100 OR 00000011.

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

Reveal detailed solution →
  1. A is the eight-bit string 01010100.
  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(0, 0) = 0.
  5. Position 6 (weight 64): OR(1, 0) = 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(0, 0) = 0.
  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: 01010111.
  13. The output is 87 when interpreted as unsigned decimal.
  14. No arithmetic carries occur in a bitwise OR operation.

Final answer: 01010111

Boolean logic · Problem 0095

Calculate 01010110 OR 00001110.

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

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

Final answer: 01011110

Boolean logic · Problem 0096

Calculate 01010110 OR 01001010.

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

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

Final answer: 01011110