| 1. | A(A + B) = ? | |
|
B
|
||
|
A
|
||
|
?
|
||
|
None of the above
|
||
View Answer
Discuss in Forum
Report Question| 2. | The Boolean expression Y = AB + (A + B)(A’ + B) may be simplified as ? | |
|
Y = A
|
||
|
Y = A’
|
||
|
Y = B
|
||
|
Y = B’
|
||
| 3. | The variable A can be written as ? | |
|
(A + B’B)
|
||
|
(B+A) (B+ A’)
|
||
|
(AB+ A’B’)
|
||
|
(B+AA’)
|
||
| 4. | How is inversion achieved using EX-OR gate ? | |
|
Giving input signal to the two input lines of the gate tied together
|
||
|
Giving input to one input line and logic zero to the other line
|
||
|
Giving input to one input line and logic one to the other line
|
||
|
Inversion cannot be achieved using EX-OR gate
|
||
| 5. | According to Boolean algebra, which one of the following is incorrect ? | |
|
A+1=1
|
||
|
A+0= A
|
||
|
A+A=0
|
||
|
A+ A’ = A
|
||
| 6. | Simplified form of the logic expression (A+B’+C)(A+B’+C’)(A+B+C) is ? | |
|
A’B+C’
|
||
|
A+B’C
|
||
|
A
|
||
|
AB + C’
|
||
| 7. | Boolean expression AC + BC’ is equivalent to ? | |
|
A’C + BC’ + AC
|
||
|
B’C+AC+ BC’ + A’CB’
|
||
|
AC + BC’ + B’C + ABC
|
||
|
ABC + A’BC’ + ABC’ + ABC’
|
||
| 8. | The function F= ABC’ + ABC+ A’BC + A’BC’; can be reduced to which one of the following ? | |
|
F = A
|
||
|
F=AB
|
||
|
F= ABC
|
||
|
F = B
|
||
| 9. | D' Morgan law is ? | |
|
(ABC)’ = A’B’C’
|
||
|
(ABC)’=A’+B’+C’
|
||
|
(A+B)’=A’+B’
|
||
|
(A+B+C)=A’+B’+C’
|
||
| 10. | In K-map simplification, a group of four adjacent 1s leads to a term with ? | |
|
one literal less than the total number of variables
|
||
|
two literals less than the total number of variables
|
||
|
three literals less than the total number of variables
|
||
|
four literals less than the total number of variables
|
||