This document describes the functionality of an n-to-m line decoder.
| Topic | Description |
|---|---|
| Definition | An n-to-m line decoder, where \(m = 2^n\), takes an n-bit binary input and activates exactly one of its \(m = 2^n\) output lines for each unique input combination. |
| Output Lines | Each output line of the decoder corresponds to one of the \(2^n\) possible minterms of the n input variables. |
| Example: 2-to-4 Decoder | A 2-to-4 line decoder has 2 input lines (say A, B) and \(2^2 = 4\) output lines. The outputs could be:
|
| Minterm Generation | An n-to-\(2^n\) line decoder is used to generate \(2^n\) minterms (or maxterms if designed with inverted outputs or different logic, but typically minterms). |
| Conclusion | Given the context is about minterms, it generates \(2^n\) minterms. Result: \(\boxed{2^n \text{ min terms}}\) |
Match the LIST-I with LIST-II
| LIST-I (Logic Gates) | LIST-II (Expressions) | ||
|---|---|---|---|
| A. | EX-OR | I. | \( A\bar{B} + \bar{A}B \) |
| B. | NAND | II. | \( A + B \) |
| C. | OR | III. | \( AB \) |
| D. | EX-NOR | IV. | \( \bar{A}\bar{B} + AB \) |
Choose the correct answer from the options given below:
Match List-I with List-II:
| List-I (Counters) | List-II (Delay/Number of States) |
|---|---|
| (A) n-bit ring counter | (I) Number of states is \( 2^n \) |
| (B) MOD-\(2^n\) asynchronous counter | (II) Fastest counter |
| (C) n-bit Johnson counter | (III) Number of used states is \( n \) |
| (D) Synchronous counter | (IV) Number of used states is \( 2n \) |
Choose the correct answer from the options given below:
A MOD 2 and a MOD 5 up-counter when cascaded together results in a MOD ______ counter.