3,926 views
1 votes
1 votes

Total number of invalid combinations for a BCD adder is

  1.   192
  2.   100
  3.    36
  4.   156
    Explanation:
    4-bits are needed to represent a BCD number.
    So, out of 16 (i.e.,24) combinations only 10 are valid. 
    Total combinations=16×16=256
    Valid combinations=10×10=100
    Invalid combinations=256-100=156

I am unable to understand this. Please explain.

1 Answer

Best answer
6 votes
6 votes
A BCD ranges from 0000 to 1001 (0 to 9) in binary, therefore we need 4 bits to represent BCD.

That means we have a total of 2^4 or 16 combinations of 4 bits available, but we require only 10, i.e.

0000,0001,0010,0011,0100,0101,0110,0111,1000 and 1001

We are left with the remaining 6 or (16-10)  combinations i.e. 1010, 1011,1100, 1101,1110 and 1111

Now, a BCD adder takes 2 two BCD numbers {BCD1, BCD2)

So we have total 16 combinations for each, therefore total combinations we have can have for both BC1 and BCD2 = 16×16=256

Out of 16, only 10 were valid, so if for each 10 were valid inputs for BCD, for both BCD1 and BCD2 we have total 10×10 or 100 valid combination of bits

So invalid inputs that can be given are 256-100 i.e. 156
selected by

Related questions

0 votes
0 votes
0 answers
1
Iqra Javed asked Jul 21, 2023
346 views
Construct a BCD-to-excess-3-code converter with a 4-bit adder. Remember that the excess-3 code digit is obtained by adding three to the corresponding BCD digit. What mus...
0 votes
0 votes
1 answer
2
Aryan asked May 31, 2016
1,205 views
the bcd adder to add two decimal digits needs minimum of a) 6 full adder, 2 half adder b) 5 full adder, 3 half adder c) 4 full adder, 3 half adder d) 5 full adder, 2 half...
0 votes
0 votes
1 answer
3
spriti1991 asked May 4, 2015
1,814 views
A decimal parallel adder that add n decimal digits needs how many BCD adder stages1. n 2. 2n3. 14 n^2