Difficulty: Easy
Correct Answer: 010001101001
Explanation:
Introduction / Context:
Binary Coded Decimal (BCD) represents each decimal digit independently using a 4-bit code. This preserves decimal structure for display and financial calculations at the cost of storage efficiency. The task is to produce straight BCD, not packed with delimiters, by simple digitwise mapping.
Given Data / Assumptions:
Concept / Approach:
Break the decimal number into digits, encode each digit into its 4-bit BCD representation, and then join the codes. No arithmetic conversion to pure binary is required for BCD; this is a symbol by symbol mapping process.
Step-by-Step Solution:
1) Split 469 into digits: 4, 6, 9.2) Encode: 4→0100, 6→0110, 9→1001.3) Concatenate: 0100 0110 1001 → 010001101001.4) Result is the straight BCD form.
Verification / Alternative check:
Confirm by reading back the 4-bit groups: 0100=4, 0110=6, 1001=9. The round trip returns the original decimal digits without ambiguity.
Why Other Options Are Wrong:
Common Pitfalls:
Using pure binary for the entire number instead of per digit mapping, or forgetting that codes 1010–1111 are invalid in straight BCD.
Final Answer:
010001101001
Discussion & Comments