Evaluate a Hexadecimal Bitwise AND

Work out the bitwise expression 0x23 & 0x34. Present both hexadecimal operands as aligned binary strings, run the AND across the bits one position at a time, and give the answer in hexadecimal. Describe what makes a result bit become one and how clusters of binary digits translate back into hexadecimal.

What a Strong Answer Covers

• Each hexadecimal digit correctly expanded into four bits.
• Place values lined up so matching positions are combined before the AND.
• The rule that a result bit is one only if both corresponding input bits are one.
• The result correctly converted back into hexadecimal.

Follow-up Questions

• What do 0x23 | 0x34 and 0x23 ^ 0x34 evaluate to?
• In what way does the width of the integer change what bitwise NOT of 0x23 produces? Overview: Solve a hexadecimal bitwise AND by widening aligned nibbles into binary and applying the per-bit rule. The worked solution turns 0x23 and 0x34 into binary, finds the one bit position both have set, and yields the precise result 0x20. Read the full Akuna Capital Software Engineer interview experience this question came from