What are the advantages and disadvantage of BCD number system?

Answer 1

Oh, dude, the BCD number system is like that old-school friend who still uses a flip phone. The advantage is it's easy for humans to read since each decimal digit is represented by a 4-bit binary number. But the downside is it's not very efficient in terms of storage space compared to other number systems. So, like, it's great for nostalgia but not so much for modern computing efficiency.

Answer 2

Well, honey, the advantage of BCD (Binary Coded Decimal) is that it's great for representing decimal numbers in a form that can be easily converted to and from human-readable form. But let's not sugarcoat it, the disadvantage is that it's inefficient in terms of storage space since it requires more bits to represent each decimal digit compared to straight binary. So, in a nutshell, BCD is handy for decimal arithmetic but not the most space-efficient option out there.

Answer 3

Advantages

• Many non-integral values, such as decimal 0.2, have an infinite place-value representation in binary (.001100110011...) but have a finite place-value in binary-coded decimal (0.0010). Consequently a system based on binary-coded decimal representations of decimal fractions avoids errors representing and calculating such values.
• Scaling by a factor of 10 (or a power of 10) is simple; this is useful when a decimal scaling factor is needed to represent a non-integer quantity (e.g., in financial calculations)
• Rounding at a decimal digit boundary is simpler. Addition and subtraction in decimal does not require rounding.
• Alignment of two decimal numbers (for example 1.3 + 27.08) is a simple, exact, shift.
• Conversion to a character form or for display (e.g., to a text-based format such as XML, or to drive signals for a seven-segment display) is a simple per-digit mapping, and can be done in linear (O(n)) time. Conversion from pure binary involves relatively complex logic that spans digits, and for large numbers no linear-time conversion algorithm is known (see Binary numeral system).

[edit]Disadvantages

• Some operations are more complex to implement. Adders require extra logic to cause them to wrap and generate a carry early. 15-20 percent more circuitry is needed for BCD add compared to pure binary. Multiplication requires the use of algorithms that are somewhat more complex than shift-mask-add (a binary multiplication, requiring binary shifts and adds or the equivalent, per-digit or group of digits is required)
• Standard BCD requires four bits per digit, roughly 20 percent more space than a binary encoding (the ratio of 4 bits to log210 bits is 1.204). When packed so that three digits are encoded in ten bits, the storage overhead is greatly reduced, at the expense of an encoding that is unaligned with the 8-bit byte boundaries common on existing hardware, resulting in slower implementations on these systems.
• Practical existing implementations of BCD are typically slower than operations on binary representations, especially on embedded systems, due to limited processor support for native BCD operations.