Question 1

How do AND, OR, and XOR work bit by bit?

Accepted Answer

Bitwise operations compare the two inputs one bit at a time at each position. AND outputs 1 only when both bits are 1. OR outputs 1 when at least one bit is 1. XOR outputs 1 when the bits are different. Common uses: AND to mask (isolate) specific bits, OR to set bits, XOR to toggle bits or detect differences between two values.

Question 2

How do left shift and right shift work?

Accepted Answer

Shift operations move every bit left or right by a given number of positions. Left shift (<<) multiplies the number by 2 for each position shifted. Right shift (>>) performs integer division by 2 for each position shifted. Bits shifted off the end are discarded. For example, 3 << 2 = 12 (3 multiplied by 4), and 36 >> 2 = 9 (36 divided by 4).

Question 3

How to add two binary numbers?

Accepted Answer

Binary addition works column by column from right to left, like decimal addition. The rules are: 0+0=0, 1+0=1, 0+1=1, 1+1=0 with carry 1. When a carry is generated, it is added to the next column. For example, 1011 + 0110 (11 + 6): starting from the right, 1+0=1, 1+1=0 carry 1, 0+1+1=0 carry 1, 1+0+1=0 carry 1, giving result 10001 = 17.

Binary Calculator – Arithmetic and Bitwise Operations

What can this binary calculator do?

How to add two binary numbers manually?

How do AND, OR, and XOR work bit by bit?

How does NOT work?

How do left shift and right shift work?

What input format is accepted?

Can results be negative?