McqMate
| Q. |
Odd parity of word can be conveniently tested by |
| A. | or gate |
| B. | and gate |
| C. | nand gate |
| D. | xor gate |
| Answer» D. xor gate | |
| Explanation: odd parity of word can be conveniently tested by xor gate, since, xor outputs 1 only when the input has odd number of 1’s. | |
1.2k
0
Do you find this helpful?
15
View all MCQs in
Digital Principles and System DesignDiscussion
Prem Pal
3 weeks ago
X Y F
0 0 0
0 1 1
1 0 1
1 1 0
0 0 0
0 1 1
1 0 1
1 1 0
-1
Related MCQs
- How many 16K * 4 RAMs are required to achieve a memory with a capacity of 64K and a word length of 8 bits?
- The parameter through which 16 distinct values can be represented is known as
- An OR gate can be imagined as
- expressions can be implemented using either (1) 2-level AND-OR logic circuits or (2) 2-level NAND logic circuits.
- Product-of-Sums expressions can be implemented using
- Don’t care conditions can be used for simplifying Boolean expressions in
- Using the transformation method you can realize any POS realization of OR-AND with only.
- Which of the following combinations of logic gates can decode binary 1101?
- The carry propagation can be expressed as
- The full subtractor can be implemented using