InterviewSolution
Saved Bookmarks
| 1. |
The minimal function that can detect a "divisible by 3" 8421 BCD code digit (representation DDDD) is given by |
| Answer» Now the problem can be solved using k-map method. The function can be expressed as Σm(0, 3, 6, 9) + d(10, 11, 12, 13, 14, 15) ∴ K-map is ∴ The function is D8D4D2D1 + D4D2D1 + D4D2D1 + D8D1 . | |