1. . In Boolean rule A + A = ___________.
(A) A̅
(B) 1
(C) None
(D) A
2. . In Boolean rule A + A̅ = ___________.
(A) 1
(B) A̅
(C) A
(D) None
3. . A̅̅ = ___________.
(A) A̅
(B) A
(C) 1
(D) None
4. . AND is a Boolean ___________.
(A) Expression
(B) Variable
(C) Operator
(D) None
5. . (A + B)(A + C) = ___________.
(A) A + BC
(B) A(B + C)
(C) AB + C
(D) None
6. . F = AB̅C + A̅B̅ + B̅C is a ___________ function.
(A) POS
(B) —
(C) SOP
(D) None
7. . F = (A + B)(A + B + C) is a ___________ function.
(A) —
(B) SOP
(C) POS
(D) None
8. . DeMorgan’s 1st theorem is (A·B)̅ = ___________.
(A) A̅ + B̅
(B) A̅ · B̅
(C) (A + B)̅
(D) None
9. . 3 variable function has the number of __________ cells.
(A) None
(B) 4
(C) 16
(D) 8
10. . F = ABC + A’BC’ + ABC’ is a ___________ SOP form.
(A) Non-standard
(B) Standard
(C) —
(D) None
11. . X + XY = ___________.
(A) 1
(B) X + 1
(C) X
(D) None
12. . Associative law states that A·(B·C) = ___________.
(A) (A·B) + C
(B) (A·B)·C
(C) (A + B)·C
(D) None
13. . 0101 = ___________.
(A) A’BC’D’
(B) A’BC’D
(C) AB’CD’
(D) ABC’D
14. . DeMorgan’s 2nd theorem is (A + B)̅ = ___________.
(A) A̅ + B̅
(B) A̅̅ · B̅
(C) A̅ · B̅
(D) None
15. . A · A̅ = ___________.
(A) A
(B) 1
(C) 0
(D) A̅