2-bit vector addition (A as MSB, B as LSB): Given [A] = 10 and [B] = 01 (both 2-bit unsigned), compute [A] + [B] as a 2-bit sum with possible carry.

Question

Solve this multiple-choice question and choose the correct option.

Accepted Answer

Introduction / Context:This problem practices basic 2-bit binary addition using vector notation. We treat 10 as decimal 2 and 01 as decimal 1, both unsigned, and compute their sum. Given Data / Assumptions: 2-bit vectors: [A] = 10 (value 2), [B] = 01 (value 1). Unsigned addition; A is the most significant bit (MSB). Report the 2-bit sum (and note if a carry would appear). Concept / Approach:Add bitwise from LSB to MSB, propagating carry as needed. 2 + 1 = 3, which in binary is 11. Since 11 fits in 2 bits, no extra carry beyond the 2-bit field is needed. Step-by-Step Solution: LSB column: 0 + 1 = 1, carry = 0.MSB column: 1 + 0 + carry 0 = 1.Concatenate: result = 11 (decimal 3). Verification / Alternative check:Decimal check: 2 + 1 = 3 → binary 11. Why Other Options Are Wrong: [00]: Would imply 0, not 3.[10]: Equals 2, the augend, not the sum.[01]: Equals 1, the addend, not the sum.[11] with carry = 0: Redundant wording; the plain [11] already implies no extra carry. Common Pitfalls:Reversing bit order or misreading which bit is MSB. Final Answer:[11]

2-bit vector addition (A as MSB, B as LSB): Given [A] = 10 and [B] = 01 (both 2-bit unsigned), compute [A] + [B] as a 2-bit sum with possible carry.

More Questions from Digital Arithmetic Operations and Circuits

Discussion & Comments