Digital Electronics - Boolean Algebra and Logic Simplification
Exercise : Boolean Algebra and Logic Simplification - True or False
- Boolean Algebra and Logic Simplification - General Questions
- Boolean Algebra and Logic Simplification - True or False
- Boolean Algebra and Logic Simplification - Filling the Blanks
11.
The symbol shown below is for a 2-input NAND gate.
12.
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.
13.
The process of reduction or simplification of combinational logic circuits increases the cost of the circuit.
14.
By applying De Morgan's theorem to a NOR gate, two identical truth tables can be produced.
15.
Five-variable Karnaugh maps are impossible.
Quick links
Quantitative Aptitude
Verbal (English)
Reasoning
Programming
Interview
Placement Papers