Question 46
How many select lines are required for a 1-to-16 Demultiplexer?
$2^n outputs = 16 => n = 4 select lines.$
How many select lines are required for a 1-to-16 Demultiplexer?
$2^n outputs = 16 => n = 4 select lines.$
Which flip-flop does not have an invalid or undefined state?
Unlike the SR flip-flop where $S=1$, $R=1 produces$ an invalid state, the JK flip-flop toggles when $J=1$, $K=1$.
In a BCD (Binary Coded Decimal) code, how many bit combinations are invalid/unused?
4 bits yield 16 combinations (0000 to 1111). BCD uses 0 to 9 (10 valid). Invalid combinations = 16 - 10 = 6 (1010 to 1111).
What is the simplified form of A . B + A . B'?
$A . B + A . B' = A . (B + B') = A . 1 = A.$
A MOD-12 counter requires a minimum of how many flip-flops?
To count up to 12 states, $2^{n-1}$ < 12 <= $2^n$. $2^3$ = 8 < 12 <= 16 = $2^4$, so 4 flip-flops are needed.