| 1. | The terms which cannot be combined further in the tabular method are called ? | |
|
implicants
|
||
|
prime implicants
|
||
|
essential prime implicants
|
||
|
selective prime implicants
|
||
View Answer
Discuss in Forum
Report Question| 2. | the Quine- McClusky method of minimization of a logic expression is a (i) graphical method (ii) algebraic method (iii) tabular method (iv) a computer-oriented algorithm The correct answers are ? | |
|
(iii) and (iv)
|
||
|
(ii) and (iv)
|
||
|
(i) and (iii)
|
||
|
(i) and (ii)
|
||
| 3. | The output of an EX-OR gate with A and B as inputs will be ? | |
|
AB+ (AB)’
|
||
|
(A+B) (A + B)’
|
||
|
(A + B) (AB)’
|
||
|
(A + B)’+ AB
|
||
| 4. | For even number of ones at the inputs, the output of EX-NOR gate is ? | |
|
low
|
||
|
high
|
||
|
oscillating
|
||
|
None of the above
|
||
| 5. | Use of De Morgan's theorem on Z =A’C(A’BD)’ will result in ? | |
|
A’C(A+B’+ D’)
|
||
|
AC (A+B’+ D)
|
||
|
AC’ (A+B’+ D’)
|
||
|
A’C (A’+B+D)
|
||
| 6. | The Boolean function A + BC is a reduced form of which one of the following ? | |
|
AB + BC
|
||
|
AB+ ABC
|
||
|
(A + B).(A + C)
|
||
|
None of the above
|
||
| 7. | A’B’C + A’BC + AB’C+ ABC is equal to ? | |
|
A
|
||
|
B
|
||
|
C
|
||
|
None of above
|
||
| 8. | AB+ A’C=(A+C) (A’ + B).... ? | |
|
AB+ A’C=AC + A’B
|
||
|
(A+B) (A’+C) = (A+C)(A’ + B)
|
||
|
(A+B) (A’+C) = AC + A’B
|
||
|
AB+ A’C=AB+ A’C + BC
|
||
| 9. | The minimized form of the logical expression (A’B’C’ + A’BC’ + A’BC + ABC’) is ? | |
|
A’C’ + BC’ + A’B
|
||
|
AC’ + B’C + A’B
|
||
|
A’C + B’C + A’B
|
||
|
AC’+ B’C + AB’
|
||
| 10. | What does the Boolean expression AD + ABCD + ACD + A B + ACD + AB, on minimization result into ? | |
|
A + D
|
||
|
AD + A’
|
||
|
AD
|
||
|
A’ + D
|
||