- 2078 Kartik · 2+2+2 marks
Code conversions: (41.8125)₁₀, (1000)₂, (19)₁₀
Short answer
(i) 41.8125₁₀ to binary: integer 41 = 101001 by division, fraction 0.8125 = .1101 by repeated multiplication, giving 101001.1101. (ii) (1000)₂ = 8₁₀ → BCD 1000. (iii) (19)₁₀ to Excess‑3: 1+3=4→0100, 9+3=12→1100 → 0100 1100.
Perform the following code conversions: (i) (41.8125)₁₀ = (?)₂ (ii) (1000)₂ = (?)BCD (iii) (19)₁₀ = (?)Ex-3 code
(i) to binary
Integer part (repeated division by 2):
| Division | Quotient | Remainder |
|---|---|---|
| 41 ÷ 2 | 20 | 1 |
| 20 ÷ 2 | 10 | 0 |
| 10 ÷ 2 | 5 | 0 |
| 5 ÷ 2 | 2 | 1 |
| 2 ÷ 2 | 1 | 0 |
| 1 ÷ 2 | 0 | 1 |
Reading upwards: .
Fraction part (repeated multiplication by 2):
| Multiplication | Result | Integer bit |
|---|---|---|
| 0.8125 × 2 | 1.625 | 1 |
| 0.625 × 2 | 1.25 | 1 |
| 0.25 × 2 | 0.5 | 0 |
| 0.5 × 2 | 1.0 | 1 |
Reading downwards: .
Answer:
(ii) to BCD
, and the digit 8 in BCD is 1000.
Answer: (or 0000 1000 when written as two BCD digits)
(iii) to Excess-3
Add 3 to each digit: 1 + 3 = 4 → 0100; 9 + 3 = 12 → 1100.
Answer:
✓ Answer checked by Claude Opus 5.5 (high effort)
Related questions
- Conversions: (21)₈, (671)₁₀ to BCD, (110101.011)₂ · Digital Logic, chapter 1
- (1110)gray→BCD and (1430)₁₀→Excess-3 · Digital Logic, chapter 1
- BCD code with examples · Digital Logic, chapter 1 · asked 2×
- BCD code and 3-bit binary-to-Gray converter · Digital Logic, chapter 1
- BCD code advantages and disadvantages · Digital Logic, chapter 1
- Gray→BCD, decimal→Excess-3 and 2's complement addition · Digital Logic, chapter 1
- Number conversions (122)10 to BCD etc. · Basic Electronics Engineering, chapter 6 · asked 3×
- Number conversions (903)10 to BCD etc. · Basic Electronics Engineering, chapter 6 · asked 3×
- Number conversions (10111.101)2 etc. · Basic Electronics Engineering, chapter 6
- Number conversions (375.37)8 etc. · Basic Electronics Engineering, chapter 6 · asked 3×