| 1. | What is the maximum number of variables that can be used in the minimization of a K-map ? | |
|
4
|
||
|
6
|
||
|
8
|
||
|
10
|
||
View Answer
Discuss in Forum
Report Question| 2. | The reason for using Gray code in K-maps is ? | |
|
gray code is efficient than binary codes
|
||
|
gray code provides cell values that differ in only one bit in adjacent cells
|
||
|
no other code is available
|
||
|
any other code can also be used
|
||
| 3. | The NAND gate can function as a NOT gate if ? | |
|
all inputs are connected together
|
||
|
inputs are left open
|
||
|
one input is set to 0
|
||
|
one input is set to 1
|
||
| 4. | What is the Boolean expression for a two-input AND gate ? | |
|
A + B
|
||
|
A.B
|
||
|
A & B
|
||
|
A – B
|
||
| 5. | How many inputs of a four-input AND gate must be HIGH in order for the output of the logic gate to go HIGH ? | |
|
any one of the inputs
|
||
|
any two of the inputs
|
||
|
any three of the inputs
|
||
|
all four inputs
|
||
| 6. | An exclusive NOR gate is logically equivalent to ? | |
|
inverter followed by an X-OR gate
|
||
|
X-OR gate followed by an inverter
|
||
|
NOT gate followed by a NOR gate
|
||
|
complement of a NOR gate
|
||
| 7. | The output of a logic gate is ‘1’ when all its input are at logic 0.The gate is either ? | |
|
NAND or an EX OR gate
|
||
|
NOR or an EX-NOR gate
|
||
|
an OR or an EX NOR gate
|
||
|
an AND or an EX-OR gate
|
||
| 8. | The SOP form of (A+C) (AB’+AC)(A’C’ + B’) is ? | |
|
AB’+ AB’C
|
||
|
A’B+ A’BC
|
||
|
A’B’+ (ABC)’
|
||
|
(A + B) (A+B’+C)
|
||
| 9. | The Boolean expression X(P, Q, R)=? (0,5) is to be realized using only two 2-input gates. Which are these gates ? | |
|
AND and OR
|
||
|
NAND and OR
|
||
|
AND and XOR
|
||
|
OR and XOR
|
||
| 10. | The canonical product of sum form of F=(A+B’) (B+C) is ? | |
|
(A+B’+C) (A+B’+C’)
|
||
|
(A+B’+C)(A+B’+C’) (A+B+C) (A’+B+C)
|
||
|
(A+B’+C) (A+B’+C’) (A+B+C)
|
||
|
(A+B’+C’) (A’+B+C)
|
||