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
Which of the following combinations cannot be combined into K-map groups?
corners in the same row
corners in the same column
diagonal
overlapping combinations
Correct Answer:
diagonal
← Previous Question
Next Question→
More Questions from
Boolean Algebra and Logic Simplification
From the truth table below, determine the standard SOP expression.
Which output expression might indicate a product-of-sums circuit construction?
The expression W(X + YZ) can be converted to SOP form by applying which law?
One of De Morgan's theorems states that . Simply stated, this means that logically there is no difference between:
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.
Discussion & Comments
No comments yet. Be the first to comment!
Name:
Comment:
Post Comment
Join Discussion
Discussion & Comments