Curioustab
Aptitude
General Knowledge
Verbal Reasoning
Computer Science
Interview
Aptitude
General Knowledge
Verbal Reasoning
Computer Science
Interview
Home
»
Digital Electronics
»
Boolean Algebra and Logic Simplification
One of De Morgan's theorems states that . Simply stated, this means that logically there is no difference between:
a NOR and an AND gate with inverted inputs
a NAND and an OR gate with inverted inputs
an AND and a NOR gate with inverted inputs
a NOR and a NAND gate with inverted inputs
Correct Answer:
a NOR and an AND gate with inverted inputs
← Previous Question
Next Question→
More Questions from
Boolean Algebra and Logic Simplification
The process of reduction or simplification of combinational logic circuits increases the cost of the circuit.
By applying De Morgan's theorem to a NOR gate, two identical truth tables can be produced.
The OR function is Boolean multiplication and the AND function is Boolean addition.
CPLD software can be used to design original circuits that prove the Boolean rules and laws.
In the commutative law, in ORing and ANDing of two variables, the order in which the variables are ORed or ANDed makes no difference.
The systematic reduction of logic circuits is performed using Boolean algebra.
In Boolean algebra, A + 1 = 1.
The product-of-sums (POS) is basically the ORing of ANDed terms.
Five-variable Karnaugh maps are impossible.
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.
Discussion & Comments
No comments yet. Be the first to comment!
Name:
Comment:
Post Comment
Join Discussion
Discussion & Comments