| 1. | A three-input NAND gate is to be used as an inverter. Which one of the following measures will achieve better results ? | |
|
The two inputs not used are kept open
|
||
|
The two inputs not used are connected to ground (0 level)
|
||
|
The two inputs not used are connected to logic (1 level)
|
||
|
None of the above
|
||
View Answer
Discuss in Forum
Report Question| 2. | Consider the following logic operators: 1. AND. 2. OR. 3. NOT. Their correct hierarchy is ? | |
|
1, 2, 3
|
||
|
3, 1, 2
|
||
|
1, 3, 2
|
||
|
2, 3, 1
|
||
| 3. | Truth table is used to express ? | |
|
Boolean expression
|
||
|
Boolean map
|
||
|
Boolean matrix
|
||
|
Boolean addition
|
||
| 4. | The boolean algebra is mostly based on ? | |
|
Boolean theorem
|
||
|
De Morgans theorem
|
||
|
De Morpans theorem
|
||
|
Standard theorem
|
||
| 5. | The output Y of a NOR gate for inputs A and B is ? | |
|
A’+B‘
|
||
|
(A+B)’
|
||
|
(A’+B’)’
|
||
|
A’B’
|
||
| 6. | Which one of the following Boolean algebra rule is correct ? | |
|
A-A’=1
|
||
|
A+ AB = A + B
|
||
|
A A’ B=A+B
|
||
|
A(A + B) = B
|
||
| 7. | The simplified Boolean equation for F = B[(A + B)(B+C)] is ? | |
|
AB(1 + C)
|
||
|
AC(1 + B)
|
||
|
AB
|
||
|
0
|
||
| 8. | The simplified form of the Boolean expression A’ + AB’ is ? | |
|
A + B
|
||
|
A+B’
|
||
|
B’+A
|
||
|
A’+B’
|
||
| 9. | [(A+B’)(C+ D’)]’, when de morgan is used, give ? | |
|
AB’+CD’
|
||
|
A.B’+C’D
|
||
|
A’.B+C’D
|
||
|
A’.B+C.D’
|
||
| 10. | The Boolean expression XB+ A. B + A.B is equivalent to ? | |
|
A+ B
|
||
|
A’.B
|
||
|
(A+B)’
|
||
|
A.B
|
||