Bitwise AND, OR, XOR in C - Step-by-Step Execution

Concept Flow - Bitwise AND, OR, XOR

Start with two integers A and B

↓

Apply Bitwise AND (&)

→Result: bits set only if both bits are 1

↓

Apply Bitwise OR (|)

→Result: bits set if either bit is 1

↓

Apply Bitwise XOR (^)

→Result: bits set if bits differ

↓

End

Start with two numbers, then apply AND, OR, XOR bit by bit to get new results.

Execution Sample

C

int a = 6;  // 0110 in binary
int b = 11; // 1011 in binary
int and_result = a & b;
int or_result = a | b;
int xor_result = a ^ b;

This code calculates bitwise AND, OR, and XOR of 6 and 11.

Execution Table

Step	Operation	a (binary)	b (binary)	Bitwise Operation	Result (binary)	Result (decimal)
1	Bitwise AND	0110	1011	0110 & 1011	0010	2
2	Bitwise OR	0110	1011	0110 | 1011	1111	15
3	Bitwise XOR	0110	1011	0110 ^ 1011	1101	13
4	End	-	-	-	-	-

💡 All bitwise operations completed on inputs a=6 and b=11.

Variable Tracker

Variable	Start	After AND	After OR	After XOR
a	6 (0110)	6 (0110)	6 (0110)	6 (0110)
b	11 (1011)	11 (1011)	11 (1011)	11 (1011)
and_result	N/A	2 (0010)	2 (0010)	2 (0010)
or_result	N/A	N/A	15 (1111)	15 (1111)
xor_result	N/A	N/A	N/A	13 (1101)

Key Moments - 3 Insights

Why does bitwise AND result in 2 instead of 6 or 11?

Because bitwise AND sets bits only where both a and b have 1s. See execution_table row 1 where 0110 & 1011 = 0010 (decimal 2).

Why is the OR result 15, which is larger than both inputs?

Bitwise OR sets bits if either input bit is 1, combining all bits from both numbers. Row 2 shows 0110 | 1011 = 1111 (decimal 15).

What does XOR do differently from OR?

XOR sets bits only where bits differ, not where both are 1. Row 3 shows 0110 ^ 1011 = 1101 (decimal 13), different from OR.

Visual Quiz - 3 Questions

Look at the execution table, what is the decimal result of the bitwise AND operation?

A 6

B 2

C 11

D 15

💡 Hint

Check execution_table row 1 under 'Result (decimal)' for AND operation.

At which step does the bitwise OR operation occur?

A Step 2

B Step 3

C Step 1

D Step 4

💡 Hint

Look at the 'Operation' column in execution_table to find OR operation.

If variable a was 7 (0111) instead of 6, what would be the new bitwise AND result with b=11?

A 2 (0010)

B 1 (0001)

C 3 (0011)

D 4 (0100)

💡 Hint

Bitwise AND sets bits where both numbers have 1s; compare 0111 & 1011.

Concept Snapshot

Bitwise AND (&), OR (|), XOR (^) work on each bit of two integers.
AND sets bit if both bits are 1.
OR sets bit if either bit is 1.
XOR sets bit if bits differ.
Used for low-level data manipulation.

Full Transcript

This lesson shows how bitwise AND, OR, and XOR work in C. We start with two integers, 6 and 11, and look at their binary forms. Bitwise AND compares each bit and sets the result bit to 1 only if both bits are 1, resulting in 2. Bitwise OR sets bits to 1 if either bit is 1, resulting in 15. Bitwise XOR sets bits to 1 only if the bits differ, resulting in 13. The execution table traces each step with binary and decimal results. The variable tracker shows how variables change after each operation. Key moments clarify common confusions about how these operators work. The quiz tests understanding by asking about results and changes. This helps beginners see exactly how bits combine in these operations.