Test 2: Combinational circuits, K-maps, and delays
This test is a set of correct/wrong statements. You
may check your answers by Clicking on the appended
Answer.
-Prof. M.-C. Brunet
- The select input to an Adder-Substractor should be set to 1 (one) to perform a substraction.
Answer
- Only essential prime implicants should be used in K-maps to obtain a simplified expression
for a Boolean function.
answer
- The outputs of a combinational circuit cannot be correct before the end of its maximum
delay.
answer
-
In a ripple adder, the second Full Adder (FA1) must wait for the output C (carry) from
the first Full Adder (FA0) to get "activated" (to produce a result).
answer
-
You can obtain the minimal sum-of-products of the complement of a Boolean function F
directly from the minimal product-of-sums expression for F.
answer
-
There is no such thing as a K-map for 8 variables.
answer
-
You can built an entire combinational circuit by using NAND gates only.
answer