Difficulty: Easy
Correct Answer: 00011001
Explanation:
Introduction / Context:One's complement is an earlier method of representing signed numbers. It is also a useful digital operation for bit manipulation, where each bit is inverted. This question reinforces knowledge of bitwise inversion.
Given Data / Assumptions:
Concept / Approach:1's complement means flipping every bit: 1→0 and 0→1. This gives the bitwise NOT of the binary number.
Step-by-Step Solution:
Original: 11100110.Invert each bit: 00011001.Final result: 00011001.Verification / Alternative check:Check bit counts: original has 5 ones, complement has 3 ones. Together, all 8 bits covered.
Why Other Options Are Wrong:
10000001: only changes some bits, not full complement.00011010: would be the 2's complement of 11100110, not 1's complement.00000000: only if input was 11111111.11111111: only if input was 00000000.Common Pitfalls:
Confusing 1's complement with 2's complement (extra +1 step).Final Answer:
00011001
Discussion & Comments