digital-electronics-boolean-algebra-and-logic-simplification Related Question Answers

1. One of De Morgan's theorems states that . Simply stated, this means that logically there is no difference between:





2. The commutative law of Boolean addition states that A + B = A × B.



3. In an atomic nucleus, neutrons and protons are held together by?





4. The systematic reduction of logic circuits is accomplished by:





5. Chisel teeth present in .........-?





6. An AND gate with schematic "bubbles" on its inputs performs the same function as a(n)________ gate.





7. For the SOP expression , how many 1s are in the truth table's output column?





8. A truth table for the SOP expression has how many input combinations?





9. How many gates would be required to implement the following Boolean expression before simplification? XY + X(X + Z) + Y(X + Z)





10. Determine the values of A, B, C, and D that make the product term equal to 1.





11. What is the primary motivation for using Boolean algebra to simplify logic expressions?





12. How many gates would be required to implement the following Boolean expression after simplification? XY + X(X + Z) + Y(X + Z)





13. AC + ABC = AC



14. When are the inputs to a NAND gate, according to De Morgan's theorem, the output expression could be:



15. Which Boolean algebra property allows us to group operands in an expression in any order without affecting the results of the operation [for example, A + B = B + A]?





16. Which among the following persons associated with Gulf?





17. When grouping cells within a K-map, the cells must be combined in groups of ________.





18. Use Boolean algebra to find the most simplified SOP expression for F = ABD + CD + ACD + ABC + ABCD.





19. Occasionally, a particular logic expression will be of no consequence in the operation of a circuit, such as a BCD-to-decimal converter. These result in ________terms in the K-map and can be treated as either ________ or ________, in order to ________ the resulting term.





20. The NAND or NOR gates are referred to as "universal" gates because either:





21. The truth table for the SOP expression has how many input combinations?





22. Converting the Boolean expression LM + M(NO + PQ) to SOP form, we get ________.





23. A Karnaugh map is a systematic way of reducing which type of expression?





24. The Boolean expression is logically equivalent to what single gate?





25. ‘Swapnavasavadatta’ is a famous book written by?





Terms And Service:We do not guarantee the accuracy of available data ..We Provide Information On Public Data.. Please consult an expert before using this data for commercial or personal use | Powered By:Omega Web Solutions
© 2002-2017 Omega Education PVT LTD...Privacy | Terms And Conditions
Question ANSWER With Solution