Curioustab
Aptitude
General Knowledge
Verbal Reasoning
Computer Science
Interview
Aptitude
General Knowledge
Verbal Reasoning
Computer Science
Interview
Home
»
Electronics
»
Logic Circuit Simplification
The systematic reduction of logic circuits is accomplished by:
symbolic reduction
TTL logic
using Boolean algebra
using a truth table
Correct Answer:
using Boolean algebra
← Previous Question
Next Question→
More Questions from
Logic Circuit Simplification
Which of the examples below expresses the commutative law of multiplication?
Which output expression might indicate a product-of-sums circuit construction?
Which of the following expressions is in the sum-of-products (SOP) form?
One of DeMorgan's theorems states that . Simply stated, this means that logically there is no difference between:
Which of the examples below expresses the distributive law of Boolean algebra?
The observation that a bubbled input OR gate is interchangeable with a bubbled output AND gate is referred to as:
Logically, the output of a NOR gate would have the same Boolean expression as a(n):
The commutative law of addition and multiplication indicates that:
The associative law of addition states that A + (B + C) = (A + B) + C.
The expressions, , are equivalent.
Discussion & Comments
No comments yet. Be the first to comment!
Name:
Comment:
Post Comment
Join Discussion
Discussion & Comments