11. Which of the following is a form of DeMorgan’s theorem?
(a)
(b)
(c)
(d)
12. The Boolean equation for a NOR function is:
(a)
(b)
(c)
(d)
13. Simplify the expression using DeMorgan’s theorems.
(a)
(b)
(c)
(d)
14. Which step in this reduction process is using DeMorgan’s theorem?
(a) STEP 1
(b) STEP 2
(c) STEP 3
(d) STEP 4
15. The special software application that translates from HDL into a grid of 1’s and 0’s, which can be loaded into a PLD, is called a:
(a) formatter.
(b) compiler.
(c) programmable wiring.
(d) CPU.
Related Posts
555555555529. When are the inputs to a NAND gate, according to De Morgan's theorem, the output expression could be: (a) X = A + B (b) (c) X = (A)(B) (d)- 555555555592. Logically, the output of a NOR gate would have the same Boolean expression as a(n): (a) NAND gate immediately followed by an inverter (b) OR gate immediately followed by an inverter (c) AND gate immediately followed by an inverter (d) NOR gate immediately followed by an inverter
- 555555555566. The Boolean expression for a 3-input AND gate is ________. (a) X = AB (b) X = ABC (c) X = A + B + C (d) X = AB + C
- 555555555591. Write the Boolean expression for an inverter logic gate with input C and output Y. (a) Y = C (b) (c) (d)
- 555555555564. The Boolean expression for a 3-input OR gate is ________. (a) X = A + B (b) X = A + B + C (c) X = ABC (d) X = A + BC