Binary addition — add two unsigned binary numbers Compute the sum of 11101 (base 2) and 10111 (base 2). Give the result in binary.

Introduction / Context:
Binary addition follows the same carry rules as decimal addition but with base 2. Practicing manual addition builds fluency for digital logic design and low-level programming. We will add two 5-bit binary numbers and present the result in binary form.

Given Data / Assumptions:

• Addend A: 11101_2.
• Addend B: 10111_2.
• Unsigned addition; no two’s complement interpretation is required.

Concept / Approach:

Add bitwise from the least significant bit, carrying 1 to the next position when a sum of two bits plus carry equals 2 or 3. 1+1 = 0 with carry 1; 1+0 or 0+1 = 1 with carry 0; 0+0 = 0 with carry 0.

Step-by-Step Solution:

Verification / Alternative check:

Convert to decimal: 11101 = 29, 10111 = 23, sum = 52. 52 in binary is 110100, matching the result.

Why Other Options Are Wrong:

110011 equals 51.

100001 equals 33.

100100 equals 36.

Common Pitfalls:

Dropping a carry, misaligning bits, or assuming fixed 5-bit width without allowing a sixth bit in the result. Always check with a decimal back-conversion for validation.

Final Answer:

110100