Discussion
Home ‣ Digital Electronics ‣ Boolean Algebra and Logic Simplification Comments
- Question
In Boolean algebra, A + 1 = 1.
Options- A. True
- B. False
- Correct Answer
- True
- 1. The systematic reduction of logic circuits is performed using Boolean algebra.
Options- A. True
- B. False Discuss
- 2. In the commutative law, in ORing and ANDing of two variables, the order in which the variables are ORed or ANDed makes no difference.
Options- A. True
- B. False Discuss
- 3. CPLD software can be used to design original circuits that prove the Boolean rules and laws.
Options- A. True
- B. False Discuss
- 4. The OR function is Boolean multiplication and the AND function is Boolean addition.
Options- A. True
- B. False Discuss
- 5. By applying De Morgan's theorem to a NOR gate, two identical truth tables can be produced.
Options- A. True
- B. False Discuss
- 6. The product-of-sums (POS) is basically the ORing of ANDed terms.
Options- A. True
- B. False Discuss
- 7. Five-variable Karnaugh maps are impossible.
Options- A. True
- B. False Discuss
- 8. The VHDL editor provided with a schematic editor development system will produce a file with the extension .vhd, which can be used by the simulator to test the output of the logic design.
Options- A. True
- B. False Discuss
- 9. SOP stands for sum-of-powers.
Options- A. True
- B. False Discuss
- 10. A Karnaugh map is similar to a truth table because it presents all the possible values of input variables and the resulting output of each value.
Options- A. True
- B. False Discuss
Boolean Algebra and Logic Simplification problems
Search Results
Correct Answer: True
Correct Answer: True
Correct Answer: True
Correct Answer: False
Correct Answer: True
Correct Answer: False
Correct Answer: False
Correct Answer: True
Correct Answer: False
Correct Answer: True
Comments
There are no comments.More in Digital Electronics:
Programming
Copyright ©CuriousTab. All rights reserved.